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

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

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2012-12-07

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/soda/BelowLR00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/BelowLR00
Alexander Below, Jesús A. De Loera, Jürgen Richter-Gebert:
Finding minimal triangulations of convex 3-polytopes is NP-hard. SODA 2000: 65-66

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.