Pages that link to "Item:Q420572"
From MaRDI portal
The following pages link to Tight lower bounds for halfspace range searching (Q420572):
Displayed 6 items.
- On the combinatorial complexity of approximating polytopes (Q1688856) (← links)
- Semi-group range sum revisited: query-space lower bound tightened (Q1751095) (← links)
- Efficient independent set approximation in unit disk graphs (Q2181244) (← links)
- IMPROVED POINTER MACHINE AND I/O LOWER BOUNDS FOR SIMPLEX RANGE REPORTING AND RELATED PROBLEMS (Q2875643) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- On semialgebraic range reporting (Q6145667) (← links)