Pages that link to "Item:Q1892425"
From MaRDI portal
The following pages link to Largest \(j\)-simplices in \(n\)-polytopes (Q1892425):
Displayed 6 items.
- Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope (Q845815) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Polynomial-time approximation of largest simplices in \(V\)-polytopes. (Q1421471) (← links)
- Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem (Q1923163) (← links)
- Approximation of convex sets by polytopes (Q2519248) (← links)
- What is known about unit cubes (Q4663501) (← links)