Searching for "A triangulation of the n-cube." – sorted by Relevance.
-
A Lower Bound for the Simplexity of the N-Cube via Hyperbolic Volumes
- . Given a triangulation of the n-cube by simplices fU (i) : 1 i T (n)g. Theorem 2.1 gives Hvol(\Xi n
- Cited by 15 (0 self) – Add To MetaCart

