Some Algorithmic Problems in Polytope Theory

Details Some Algorithmic Problems in Polytope Theory Some Algorithmic Problems in Polytope Theory

2002-02-20

arxiv.org/abs/math/0202204v1

Mathematics

Combinatorics

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Some Algorithmic Problems in Polytope Theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Some Algorithmic Problems in Polytope Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some Algorithmic Problems in Polytope Theory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-538872