The Complexity of Finding Small Triangulations of Convex 3-Polytopes
  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. 
Alexander Below (Informatik ETH-Zurich), Jes\'us A. De Loera (Univ. of   California, Davis), J\"urgen Richter-Gebert (Inform...