The Complexity of Finding Small Triangulations of Convex 3-Polytopes

Alexander Below, Jesús A. De Loera, Jürgen Richter-Gebert

The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is proved to be NP-hard. We discuss other related complexity results.