Pages that link to "Item:Q1344616"
From MaRDI portal
The following pages link to On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616):
Displayed 10 items.
- Generalized semi-infinite programming: a tutorial (Q929611) (← links)
- The Blaschke-Steinhardt point of a planar convex set (Q1339815) (← links)
- Polynomial-time approximation of largest simplices in \(V\)-polytopes. (Q1421471) (← links)
- Inner and outer approximations of polytopes using boxes. (Q1428115) (← links)
- On computing the diameter of a point set in high dimensional Euclidean space. (Q1853493) (← links)
- Symmetric conference matrices and locally largest regular crosspolytopes in cubes (Q1855403) (← links)
- Largest \(j\)-simplices in \(n\)-polytopes (Q1892425) (← links)
- (Deterministic) algorithms that compute the volume of polytopes (Q4360038) (← links)
- Deterministic and randomized polynomial‐time approximation of radii (Q4435530) (← links)
- New Algorithms for k-Center and Extensions (Q5505644) (← links)