Pages that link to "Item:Q4606294"

The following pages link to Solving k-SUM using few linear queries (Q4606294):

Displaying 11 items.

• Minimizing the sum of the \(k\) largest functions in linear time. (Q1853685) (← links)
• Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model (Q2096389) (← links)
• On 3SUM-hard problems in the decision tree model (Q2117780) (← links)
• Geometric pattern matching reduces to \(k\)-SUM (Q2172655) (← links)
• 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)
• A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM (Q4580116) (← 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)
• (Q5875468) (← links)
• Geometric Pattern Matching Reduces to k-SUM. (Q6065434) (← links)