The following pages link to (Q4607966):
Displaying 10 items.
- Fine-grained complexity theory: conditional lower bounds for computational geometry (Q2117766) (← links)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- A new coding-based algorithm for finding closest pair of vectors (Q2420648) (← links)
- On the Complexity of Closest Pair via Polar-Pair of Point-Sets (Q3122310) (← links)
- Hamming Distance Completeness (Q5088904) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
- On the Complexity of Closest Pair via Polar-Pair of Point-Sets (Q5115796) (← links)
- (Q5121902) (← links)
- (Q5875463) (← links)
