Pages that link to "Item:Q2415377"

The following pages link to A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model (Q2415377):

Displaying 11 items.

• Point location in arrangements of hyperplanes (Q690248) (← links)
• Selecting distances in arrangements of hyperplanes spanned by points. (Q878011) (← links)
• Active-learning a convex body in low dimensions (Q2032355) (← 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)
• Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location (Q2189742) (← links)
• A note on point location in arrangements of hyperplanes (Q2390231) (← links)
• A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM (Q4580116) (← links)
• Near-optimal linear decision trees for k-SUM and related problems (Q5230319) (← links)
• Geometric Pattern Matching Reduces to k-SUM. (Q6065434) (← links)