Research articles

search articles

My Pages

Stat

Members: 3645
Articles: 2'504'585
Articles rated: 2609

24 April 2024

» arxiv » math.CO/0012177

Article overview

The Complexity of Finding Small Triangulations of Convex 3-Polytopes
Alexander Below ; Jesús A. De Loera ; Jürgen Richter-Gebert ;
Date:	19 Dec 2000
Subject:	Combinatorics; Metric Geometry MSC-class: 52B; 52C45; 68Q \| math.CO math.MG
Affiliation:	Informatik ETH-Zurich), Jesús A. De Loera (Univ. of California, Davis), Jürgen Richter-Gebert (Informatik ETH-Zurich
Abstract:	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.
Source:	arXiv, math.CO/0012177
Services:	Forum \| Review \| PDF \| Favorites

No review found.

Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.

browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)

ScienXe.org
» my Online CV
» Free

News, job offers and information for researchers and scientists:

home

contact

sitemap