mlsanityData to 7 Oct 2026

Slicing the hypercube is not easy

arXiv 2102.05536 ↗First posted 10 Feb 2021math.CO cs.AI cs.CCcited by 1

Not on the map. Why?

Abstract (arXiv)

We prove that at least Omega(n0.51) hyperplanes are needed to slice all edges of the n-dimensional hypercube. We provide a couple of applications: lower bounds on the computational complexity of parity, and a lower bound on the cover number of the hypercube by skew hyperplanes.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 0 of its 25 references that are in the map. First posted on arXiv 10 Feb 2021.

Builds on

0 of 25 references.

No references here yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.

  1. 2026Improved Upper Bounds for Slicing the Hypercubecited by 1