Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision tree model (Q6187787)
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: Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision tree model |
scientific article; zbMATH DE number 7788576
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision tree model |
scientific article; zbMATH DE number 7788576 |
Statements
15 January 2024
0 references
computational geometry
0 references
algebraic decision-tree model
0 references
polynomial partitioning
0 references
primal-dual range searching
0 references
order types
0 references
point location
0 references
hierarchical partitions
0 references
0.9919190406799316
0 references
0.8834506273269653
0 references
0.8438584804534912
0 references
0.8416073322296143
0 references
0.8148967027664185
0 references
