Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\) (Q2921757)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\) |
scientific article; zbMATH DE number 6354911
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\) |
scientific article; zbMATH DE number 6354911 |
Statements
13 October 2014
0 references
Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\) (English)
0 references
