Pages that link to "Item:Q2819559"
From MaRDI portal
The following pages link to A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube (Q2819559):
Displayed 6 items.
- Tighter lower bounds for nearest neighbor search and related problems in the cell probe model (Q696979) (← links)
- A strong lower bound for approximate nearest neighbor searching (Q834886) (← links)
- Optimal bounds for the predecessor problem and related problems (Q1869935) (← links)
- The cell probe complexity of succinct data structures (Q2373728) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- Cell-probe lower bounds for the partial match problem (Q5917577) (← links)