On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390): Difference between revisions

@@ label / en / label / en @@
+On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
@@ Property / DOI @@
-.4230/LIPIcs.ITCS.2019.17
@@ Property / DOI: 10.4230/LIPIcs.ITCS.2019.17 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / cites work @@
+Euclidean minimum spanning trees and bichromatic closest pairs
+Normal rank
@@ Property / cites work @@
+The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
+Normal rank
@@ Property / cites work @@
+Q3655274
@@ Property / cites work: Q3655274 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear codes with exponentially many light vectors
+Normal rank
@@ Property / cites work @@
+Multidimensional divide-and-conquer
@@ Property / cites work: Multidimensional divide-and-conquer / rank @@
+Normal rank
@@ Property / cites work @@
+Q4140384
@@ Property / cites work: Q4140384 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH
+Normal rank
@@ Property / cites work @@
+Monotone maps, sphericity and bounded second eigenvalue
+Normal rank
@@ Property / cites work @@
+From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More
+Normal rank
@@ Property / cites work @@
+Q5121902
@@ Property / cites work: Q5121902 / rank @@
+Normal rank
@@ Property / cites work @@
+An Equivalence Class for Orthogonal Vectors
@@ Property / cites work: An Equivalence Class for Orthogonal Vectors / rank @@
+Normal rank
@@ Property / cites work @@
+A Deterministic Reduction for the Gap Minimum Distance Problem
+Normal rank
@@ Property / cites work @@
+Approximating Matrix Multiplication for Pattern Recognition Tasks
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Closest Pair via Polar-Pair of Point-Sets
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness of approximating the minimum distance of a linear code
+Normal rank
@@ Property / cites work @@
+On the contact dimensions of graphs
@@ Property / cites work: On the contact dimensions of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Powers of tensors and fast matrix multiplication
@@ Property / cites work: Powers of tensors and fast matrix multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Dominance Product and High-Dimensional Closest Pair under L_infty
+Normal rank
@@ Property / cites work @@
+Q4952640
@@ Property / cites work: Q4952640 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Extensions of Lipschitz mappings into a Hilbert space
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of approximating dominating set
+Normal rank
@@ Property / cites work @@
+A simple randomized sieve algorithm for the closest-pair problem
+Normal rank
@@ Property / cites work @@
+Q4527027
@@ Property / cites work: Q4527027 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4948733
@@ Property / cites work: Q4948733 / rank @@
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of <i>k</i>-B<scp>iclique</scp>
+Normal rank
@@ Property / cites work @@
+Q3992671
@@ Property / cites work: Q3992671 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds on Locality Sensitive Hashing
@@ Property / cites work: Lower Bounds on Locality Sensitive Hashing / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
+Normal rank
@@ Property / cites work @@
+Q3886431
@@ Property / cites work: Q3886431 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4164569
@@ Property / cites work: Q4164569 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial Codes Over Certain Finite Fields
@@ Property / cites work: Polynomial Codes Over Certain Finite Fields / rank @@
+Normal rank
@@ Property / cites work @@
+Embeddings of graphs in Euclidean spaces
@@ Property / cites work: Embeddings of graphs in Euclidean spaces / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness of approximate nearest neighbor search
@@ Property / cites work: Hardness of approximate nearest neighbor search / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem
+Normal rank
@@ Property / cites work @@
+Q3250141
@@ Property / cites work: Q3250141 / rank @@
+Normal rank
@@ Property / cites work @@
+Lattices with exponentially large kissing numbers
@@ Property / cites work: Lattices with exponentially large kissing numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Q4607966
@@ Property / cites work: Q4607966 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
+Normal rank
@@ Property / cites work @@
+Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
+Normal rank
@@ Property / full work available at URL @@
+http://drops.dagstuhl.de/opus/volltexte/2018/10110/pdf/LIPIcs-ITCS-2019-17.pdf/
+Normal rank
@@ Property / OpenAlex ID @@
+W2903060623
@@ Property / OpenAlex ID: W2903060623 / rank @@
+Normal rank
@@ Property / title @@
+On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (English)
+Normal rank
@@ Property / DOI @@
+.4230/LIPICS.ITCS.2019.17
@@ Property / DOI: 10.4230/LIPICS.ITCS.2019.17 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5090390