Pages that link to "Item:Q5111730"

The following pages link to Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy (Q5111730):

Displaying 10 items.

• 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 algebraic 3SUM (Q2415376) (← links)
• A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model (Q2415377) (← links)
• Time and space efficient collinearity indexing (Q2678263) (← links)
• Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
• A subquadratic algorithm for 3XOR (Q5005162) (← links)
• On Multidimensional and Monotone k-SUM (Q5111265) (← links)
• Geometric Pattern Matching Reduces to k-SUM. (Q6065434) (← links)