2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/60602The 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.37 pages. An earlier version containing the sketch of the proof appeared at the proceedings of SODA 2000CombinatoricsMetric Geometry52B; 52C45; 68Qtext