Some Algorithmic Problems in Polytope Theory
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:4PEIJSCUrecord.jsonopen to challenge →
classification
math.CO
math.MG
keywords
problemsalgorithmiccombinatorialpolytopesbeyondcomplexityconvexcoordinate
read the original abstract
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The problems are grouped into the sections ``Coordinate Descriptions'', ``Combinatorial Structure'', ``Isomorphism'', ``Optimization'', ``Realizability'', and ``Beyond Polytopes''.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.