scientific article; zbMATH DE number 5302815
From MaRDI portal
Publication:3514520
Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Convexity and finite-dimensional Banach spaces (including special norms, zonoids, etc.) (aspects of convex geometry) (52A21) Approximation by convex sets (52A27) Computational aspects related to convexity (52B55) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)
Recommendations
- On the complexity of the set of unconditional convex bodies
- Complexity of convex stereohedra
- On the complexity of convex hulls of subsets of the two-dimensional plane
- On the Complexity of Computing the Volume of a Polyhedron
- scientific article; zbMATH DE number 1182912
- Computability of convex sets
- Computing D-convex hulls in the plane
- scientific article; zbMATH DE number 665697
- scientific article; zbMATH DE number 431987
- Optimal computation of finitely oriented convex hulls
Cited in
(23)- Complexity of convex optimization using geometry-based measures and a reference point
- Oracle-polynomial-time approximation of largest simplices in convex bodies
- Floating bodies and approximation of convex bodies by polytopes
- Complexity yardsticks for \(f\)-vectors of polytopes and spheres
- Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points
- A positive semidefinite approximation of the symmetric traveling salesman polytope
- Convex hulls, oracles, and homology
- Mixed integer linear programming formulation techniques
- Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model
- From Shapes to Amortized Complexity
- Approximating the centroid is hard
- scientific article; zbMATH DE number 16658 (Why is no real title available?)
- scientific article; zbMATH DE number 1077802 (Why is no real title available?)
- scientific article; zbMATH DE number 1182920 (Why is no real title available?)
- scientific article; zbMATH DE number 6820278 (Why is no real title available?)
- Polynomial norms
- On approximation by projections of polytopes with few facets
- Semidefinite approximations of conical hulls of measured sets
- On the complexity of the set of unconditional convex bodies
- On clustering bodies: geometry and polyhedral approximation
- Representing simple d-dimensional polytopes by d polynomials
- Hardness of approximation of centered convex bodies by polytopes
- Algorithmic complexity of a problem of idempotent convex geometry.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3514520)
