4 citations · 9 across the 3 of their papers we have counts for
1 paper · 1 filter
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.