Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model (Q2096389)
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 \textsc{3sum}-hard geometric problems in the algebraic decision-tree model |
scientific article; zbMATH DE number 7618089
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model |
scientific article; zbMATH DE number 7618089 |
Statements
Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model (English)
0 references
16 November 2022
0 references
\textsc{3sum}-hard problems
0 references
algebraic decision-tree model
0 references
point location
0 references
polynomial partitions
0 references
order type
0 references
0 references
0 references
0 references
0 references
0.88213843
0 references
0 references
0 references
0.8577336
0 references
0.85119826
0 references
0.8364039
0 references
0.8364039
0 references
0 references
0 references
