Pages that link to "Item:Q4580116"
From MaRDI portal
The following pages link to A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM (Q4580116):
Displaying 6 items.
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model (Q2415377) (← links)
- Solving k-SUM using few linear queries (Q4606294) (← links)
- (Q5002761) (← links)
- Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy (Q5111730) (← links)
- Near-optimal linear decision trees for k-SUM and related problems (Q5230319) (← links)