Show all news
The target is to represent a strictly convex polytope in R³ with integer coordinates in minimum volume.
The best upper bound is actually exponential in the number of vertices of the skeleton of the polytope.
The best lower bound is actually polynomial in the number of vertices of the skeleton of the polytope.
This thesis consists of the following phases: