The following pages link to (Q4952640):
Displayed 4 items.
- Explicit Euclidean embeddings in permutation invariant normed spaces (Q457553) (← links)
- Tighter lower bounds for nearest neighbor search and related problems in the cell probe model (Q696979) (← links)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)