The following pages link to Hyperplane cuts of an n-cube (Q2546506):
Displayed 13 items.
- Computing and analyzing recoverable supports for sparse reconstruction (Q269197) (← links)
- On the cut-complexes of the 5-cube (Q582575) (← links)
- On the coverings of the \(d\)-cube for \(d\leq 6\) (Q1003460) (← links)
- Unconditional lower bounds for learning intersections of halfspaces (Q1009217) (← links)
- On the cuts and cut number of the 4-cube (Q1073345) (← links)
- On the covering cuts of c d (d\(\leq 5)\) (Q1097520) (← links)
- Spectral properties of threshold functions (Q1323477) (← links)
- Cutting a polytope (Q1900020) (← links)
- Facet-reducing cuts of a convex polytope (Q1900968) (← links)
- Shadow-boundaries of convex bodies (Q1923492) (← links)
- On the cut number problem for the 4, and 5-cubes (Q1983113) (← links)
- Intersecting all edges of centrally symmetric polyhedra by planes (Q2560622) (← links)
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results (Q4819851) (← links)