Pages that link to "Item:Q1163235"
From MaRDI portal
The following pages link to Minimal triangulation of the 4-cube (Q1163235):
Displaying 16 items.
- On \(0/1\)-polytopes with nonobtuse triangulations (Q669635) (← links)
- Minimum-cardinality triangulations of the \(d\)-cube for \(d=5\) and \(d=6\) (Q685587) (← links)
- A note on triangulating the 5-cube (Q802144) (← links)
- A simple and relatively efficient triangulation of the n-cube (Q804290) (← links)
- A triangulation of the n-cube (Q1163234) (← links)
- A note on minimal triangulations of an n-cube (Q1166776) (← links)
- Some computational methods for systems of nonlinear equations and systems of polynomial equations (Q1201902) (← links)
- A control problem for affine dynamical systems on a full-dimensional polytope. (Q1426256) (← links)
- Lower bounds for the simplexity of the \(n\)-cube (Q1759408) (← links)
- Convex envelopes for edge-concave functions (Q1780948) (← links)
- Simplexity of the cube (Q1815315) (← links)
- A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes (Q1964654) (← links)
- The Middle-Cut Triangulations of the <i>n</i>-Cube (Q3331832) (← links)
- A Lower Bound Technique for Triangulations of Simplotopes (Q4601211) (← links)
- Identification of piecewise affine models in noisy environment (Q4800358) (← links)
- Efficient P1-FEM for any space dimension in \textsc{Matlab} (Q6557143) (← links)
