scientific article
zbMATH Open1145.52002arXivmath/0610325MaRDI QIDQ3514520FDOQ3514520
Authors: Ellen Veomett, Alexander Barvinok 
Publication date: 21 July 2008
Full work available at URL: https://arxiv.org/abs/math/0610325
Title of this publication is not available (Why is that?)
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
Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Computational aspects related to convexity (52B55) 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)
Cited In (21)
- Convex hulls, oracles, and homology
- Complexity yardsticks for \(f\)-vectors of polytopes and spheres
- Algorithmic complexity of a problem of idempotent convex geometry.
- A positive semidefinite approximation of the symmetric traveling salesman polytope
- Polynomial Norms
- Approximating the centroid is hard
- Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points
- Mixed integer linear programming formulation techniques
- Title not available (Why is that?)
- Representing simple \(d\)-dimensional polytopes by \(d\) polynomials
- From Shapes to Amortized Complexity
- On approximation by projections of polytopes with few facets
- Floating bodies and approximation of convex bodies by polytopes
- On the complexity of the set of unconditional convex bodies
- Title not available (Why is that?)
- On clustering bodies: geometry and polyhedral approximation
- Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model
- Complexity of convex optimization using geometry-based measures and a reference point
- Title not available (Why is that?)
- Semidefinite approximations of conical hulls of measured sets
- Oracle-polynomial-time approximation of largest simplices in convex bodies
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)
