A New Lower Bound Technique and Its Application: Tight Lower Bound for a Polygon Triangulation Problem (Q4305360)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 638385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A New Lower Bound Technique and Its Application: Tight Lower Bound for a Polygon Triangulation Problem |
scientific article; zbMATH DE number 638385 |
Statements
A New Lower Bound Technique and Its Application: Tight Lower Bound for a Polygon Triangulation Problem (English)
0 references
13 September 1994
0 references
time-complexity
0 references
polygon triangulation
0 references
matrix chain product
0 references
bounded degree algebraic decision trees
0 references
0.7530180215835571
0 references
0.7513506412506104
0 references
0.7402343153953552
0 references
0.7400487661361694
0 references
0.7342381477355957
0 references
