The complexity of finding small triangulations of convex 3-polytopes (Q4820878): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: math/0012177 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2075947157 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:35, 30 July 2024
scientific article; zbMATH DE number 2105330
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of finding small triangulations of convex 3-polytopes |
scientific article; zbMATH DE number 2105330 |
Statements
The complexity of finding small triangulations of convex 3-polytopes (English)
0 references
1 October 2004
0 references
optimal triangulations
0 references
