"Finding Small Triangulations of Polytope Boundaries Is Hard."

Jürgen Richter-Gebert (2000)

> Home

Details and statistics

DOI: 10.1007/S004540010052

access: open

type: Journal Article

metadata version: 2024-10-06

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dcg/Richter-Gebert00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcg/Richter-Gebert00
Jürgen Richter-Gebert:
Finding Small Triangulations of Polytope Boundaries Is Hard. Discret. Comput. Geom. 24(2-3): 503-518 (2000)

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.