Pages that link to "Item:Q4580085"
From MaRDI portal
The following pages link to Subquadratic algorithms for algebraic generalizations of 3SUM (Q4580085):
Displaying 9 items.
- 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)
- On 3SUM-hard problems in the decision tree model (Q2117780) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- Subquadratic algorithms for 3SUM (Q2482729) (← links)
- Finding Points in General Position (Q4605338) (← links)
- A subquadratic algorithm for 3XOR (Q5005162) (← links)
- Algebraic algorithms for variants of subset sum (Q6102280) (← links)