Some Algorithmic Problems in Polytope Theory

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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''.

Keywords

Combinatorics, Metric Geometry, 52Bxx (Primary) 68Q25 (Secondary)

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/63388

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0202204
 http://arxiv.org/abs/math/0202204

Collections

arXiv