Finding minimal triangulations of convex 3-polytopes is NP-hard

Alexander Below, Jesús A. De Loera, and Jürgen Richter-Gebert
Proc. 11th Symp. Discrete Algorithms, ACM and SIAM, Jan 2000, pp. 65–66

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!