Pages that link to "Item:Q2415377"
From MaRDI portal
The following pages link to A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model (Q2415377):
Displaying 6 items.
- 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)
- Geometric Pattern Matching Reduces to k-SUM. (Q6065434) (← links)
