Pages that link to "Item:Q5230319"

The following pages link to Near-optimal linear decision trees for k-SUM and related problems (Q5230319):

Displaying 13 items.

• On 3SUM-hard problems in the decision tree model (Q2117780) (← links)
• A \#SAT algorithm for small constant-depth circuits with PTF gates (Q2118395) (← links)
• Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location (Q2189742) (← 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)
• (Q2768648) (← links)
• A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM (Q4580116) (← links)
• Solving k-SUM using few linear queries (Q4606294) (← links)
• A subquadratic algorithm for 3XOR (Q5005162) (← links)
• (Q5009621) (← links)
• Querying a Matrix Through Matrix-Vector Products. (Q5091255) (← links)
• Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy (Q5111730) (← links)
• Top-𝑘-convolution and the quest for near-linear output-sensitive subset sum (Q5144983) (← links)