scientific article; zbMATH DE number 1182920

MaRDI QIDQ4401017zbMATH OpenFDO

Authors Peter Gritzmann, Victor Klee

Publication date 11 February 2001

zbMATH Keywords

computational complexityconvex bodiesqualitative matricespresentations of polytopes

Mathematics Subject Classification ID

Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Mixed volumes and related topics in convex geometry (52A39)

Recommendations

• scientific article; zbMATH DE number 1182912
• scientific article; zbMATH DE number 1266748
• scientific article; zbMATH DE number 3219
• Convex Analysis
• Convex Analysis
• scientific article
• Computability of convex sets
• Convex optimization: algorithms and complexity
• scientific article; zbMATH DE number 3945887

Cited in

(9)

• The computational complexity of duality
• The best ways to slice a polytope
• Polytope Containment and Determination by Linear Probes
• scientific article; zbMATH DE number 841436 (Why is no real title available?)
• Fixed-parameter complexity and approximability of norm maximization
• Equality cases of the Alexandrov-Fenchel inequality are not in the polynomial hierarchy
• Computing the Ehrhart polynomial of a convex lattice polytope
• On the complexity of some basic problems in computational convexity. I. Containment problems
• Numerical decomposition of a convex function

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 Q4401017)