The following pages link to (Q3514520):
Displaying 20 items.
- On approximation by projections of polytopes with few facets (Q476495) (← links)
- Semidefinite approximations of conical hulls of measured sets (Q512256) (← links)
- On clustering bodies: geometry and polyhedral approximation (Q603849) (← links)
- Representing simple \(d\)-dimensional polytopes by \(d\) polynomials (Q623364) (← links)
- Algorithmic complexity of a problem of idempotent convex geometry. (Q869763) (← links)
- Complexity of convex optimization using geometry-based measures and a reference point (Q1434069) (← links)
- Oracle-polynomial-time approximation of largest simplices in convex bodies (Q1574577) (← links)
- Floating bodies and approximation of convex bodies by polytopes (Q2135725) (← links)
- Complexity yardsticks for \(f\)-vectors of polytopes and spheres (Q2197688) (← links)
- Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points (Q2365326) (← links)
- A positive semidefinite approximation of the symmetric traveling salesman polytope (Q2385145) (← links)
- Convex hulls, oracles, and homology (Q2643561) (← links)
- Mixed integer linear programming formulation techniques (Q2808240) (← links)
- Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model (Q3169071) (← links)
- From Shapes to Amortized Complexity (Q3296329) (← links)
- (Q3973344) (← links)
- (Q4401017) (← links)
- (Q4598229) (← links)
- Polynomial Norms (Q4620456) (← links)
- On the complexity of the set of unconditional convex bodies (Q5964224) (← links)
