Some Algorithmic Problems in Polytope Theory

Volker Kaibel () and Marc E. Pfetsch ()
Additional contact information
Volker Kaibel: Technische Universität Berlin, Institut für Mathematik, MA 6-2
Marc E. Pfetsch: Technische Universität Berlin, Institut für Mathematik, MA 6-2

A chapter in Algebra, Geometry and Software Systems, 2003, pp 23-47 from Springer

Abstract: Abstract Many interesting algorithmic problems naturally arise in the theory of convex polytopes. In this article we collect 35 such problems and briefly discuss the current knowledge on their complexity status.

Keywords: Polynomial Time; Simplicial Complex; Face Lattice; Simplex Algorithm; Fixed Dimension (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-05148-1_2

Ordering information: This item can be ordered from
http://www.springer.com/9783662051481

DOI: 10.1007/978-3-662-05148-1_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().