Hyperplane cuts of an n-cube
From MaRDI portal
Publication:2546506
DOI10.1016/0012-365X(71)90025-2zbMath0218.05003OpenAlexW2063165065WikidataQ105870752 ScholiaQ105870752MaRDI QIDQ2546506
Publication date: 1971
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(71)90025-2
Related Items
Computing and analyzing recoverable supports for sparse reconstruction ⋮ On the covering cuts of c d (d\(\leq 5)\) ⋮ Cutting a polytope ⋮ Facet-reducing cuts of a convex polytope ⋮ General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results ⋮ Shadow-boundaries of convex bodies ⋮ On the cut number problem for the 4, and 5-cubes ⋮ On the cut-complexes of the 5-cube ⋮ On the coverings of the \(d\)-cube for \(d\leq 6\) ⋮ Unconditional lower bounds for learning intersections of halfspaces ⋮ Intersecting all edges of centrally symmetric polyhedra by planes ⋮ On the cuts and cut number of the 4-cube ⋮ Spectral properties of threshold functions
Cites Work