Some Algorithmic Problems in Polytope Theory

Simple item page
dc.creatorKaibel, Volker
dc.creatorPfetsch, Marc E.
dc.date2002-02-20
dc.date.accessioned2026-07-07T04:46:35Z
dc.date.available2026-07-07T04:46:35Z
dc.descriptionThis 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''.
dc.identifierhttps://arxiv.org/abs/math/0202204
dc.identifierhttp://arxiv.org/abs/math/0202204
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/63388
dc.subjectCombinatorics
dc.subjectMetric Geometry
dc.subject52Bxx (Primary) 68Q25 (Secondary)
dc.titleSome Algorithmic Problems in Polytope Theory
dc.typetext

Files

Collections

arXiv