Pages that link to "Item:Q2415376"
From MaRDI portal
The following pages link to Subquadratic algorithms for algebraic 3SUM (Q2415376):
Displaying 11 items.
- Improved subquadratic 3SUM (Q513274) (← links)
- On a class of \(O(n^ 2)\) problems in computational geometry (Q1903639) (← links)
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model (Q2096389) (← links)
- Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems (Q2105319) (← links)
- Geometric pattern matching reduces to \(k\)-SUM (Q2172655) (← links)
- Subquadratic algorithms for 3SUM (Q2482729) (← links)
- Time and space efficient collinearity indexing (Q2678263) (← links)
- Subquadratic algorithms for algebraic generalizations of 3SUM (Q4580085) (← links)
- (Q5875468) (← links)
- Geometric Pattern Matching Reduces to k-SUM. (Q6065434) (← links)
- Algebraic algorithms for variants of subset sum (Q6102280) (← links)