On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic

Karthik C. S., Pasin Manurangsi. On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic. Electronic Colloquium on Computational Complexity (ECCC), 25:210, 2018. [doi]

Abstract

Abstract is missing.