Pith. sign in

REVIEW

Some Algorithmic Problems in Polytope Theory

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv math/0202204 v1 pith:4PEIJSCU submitted 2002-02-20 math.CO math.MG

Some Algorithmic Problems in Polytope Theory

Volker Kaibel , Marc E. Pfetsch This is my paper
classification math.CO math.MG
keywords problemsalgorithmiccombinatorialpolytopesbeyondcomplexityconvexcoordinate
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
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''.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.