scientific article; zbMATH DE number 5302815
From MaRDI portal
Publication:3514520
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)
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
(21)- A positive semidefinite approximation of the symmetric traveling salesman polytope
- Approximating the centroid is hard
- scientific article; zbMATH DE number 16658 (Why is no real title available?)
- Representing simple \(d\)-dimensional polytopes by \(d\) polynomials
- On the complexity of the set of unconditional convex bodies
- Convex hulls, oracles, and homology
- Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points
- Polynomial norms
- Floating bodies and approximation of convex bodies by polytopes
- Algorithmic complexity of a problem of idempotent convex geometry.
- scientific article; zbMATH DE number 1182920 (Why is no real title available?)
- On clustering bodies: geometry and polyhedral approximation
- scientific article; zbMATH DE number 6820278 (Why is no real title available?)
- Mixed integer linear programming formulation techniques
- Complexity yardsticks for \(f\)-vectors of polytopes and spheres
- From Shapes to Amortized Complexity
- Complexity of convex optimization using geometry-based measures and a reference point
- Semidefinite approximations of conical hulls of measured sets
- Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model
- On approximation by projections of polytopes with few facets
- 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)
