The complexity of subdivision for diameter-distance tests (Q2188972)
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 7211781
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of subdivision for diameter-distance tests |
scientific article; zbMATH DE number 7211781 |
Statements
The complexity of subdivision for diameter-distance tests (English)
0 references
15 June 2020
0 references
algorithmic complexity
0 references
worst case bit-complexity
0 references
subdivision algorithms
0 references
continuous amortization
0 references
adaptive complexity
0 references
separation bounds
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.857659637928009
0 references
0.8399017453193665
0 references
0.763178288936615
0 references
0.7395164966583252
0 references
