scientific article; zbMATH DE number 6850387
From MaRDI portal
Publication:4607966
zbMath1403.68321arXiv1709.05282MaRDI QIDQ4607966
Publication date: 15 March 2018
Full work available at URL: https://arxiv.org/abs/1709.05282
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (10)
On the Complexity of Closest Pair via Polar-Pair of Point-Sets ⋮ A new coding-based algorithm for finding closest pair of vectors ⋮ Unnamed Item ⋮ On closest pair in Euclidean metric: monochromatic is as hard as bichromatic ⋮ Unnamed Item ⋮ Hamming Distance Completeness ⋮ On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic ⋮ A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties ⋮ On the Complexity of Closest Pair via Polar-Pair of Point-Sets ⋮ Fine-grained complexity theory: conditional lower bounds for computational geometry
This page was built for publication:
