Hyperplane cuts of an n-cube
From MaRDI portal
Publication:2546506
DOI10.1016/0012-365X(71)90025-2zbMath0218.05003WikidataQ105870752 ScholiaQ105870752MaRDI QIDQ2546506
Publication date: 1971
Published in: Discrete Mathematics (Search for Journal in Brave)
05A15: Exact enumeration problems, generating functions
Related Items
General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results, Computing and analyzing recoverable supports for sparse reconstruction, 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, On the cuts and cut number of the 4-cube, On the covering cuts of c d (d\(\leq 5)\), Spectral properties of threshold functions, Cutting a polytope, Facet-reducing cuts of a convex polytope, Shadow-boundaries of convex bodies, Intersecting all edges of centrally symmetric polyhedra by planes
Cites Work