On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114229222, #quickstatements; #temporary_batch_1718136167263
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s00493-019-4113-1 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Linear codes with exponentially many light vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3655274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional divide-and-conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone maps, sphericity and bounded second eigenvalue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5121902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Matrix Multiplication for Pattern Recognition Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Deterministic Reduction for the Gap Minimum Distance Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Closest Pair via Polar-Pair of Point-Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of approximating the minimum distance of a linear code / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the contact dimensions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymptotic behaviour of some towers of function fields over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of Lipschitz mappings into a Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of approximating dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple randomized sieve algorithm for the closest-pair problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of the <i>k</i> -Biclique Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dispersed points and geometric embedding of complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Locality Sensitive Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3886431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4137124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embeddings of graphs in Euclidean spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of approximate nearest neighbor search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic function fields and codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3250141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices with exponentially large kissing numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for optimal 2-constraint satisfaction and its implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00493-019-4113-1 / rank
 
Normal rank

Latest revision as of 13:24, 17 December 2024

scientific article
Language Label Description Also known as
English
On closest pair in Euclidean metric: monochromatic is as hard as bichromatic
scientific article

    Statements

    On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (English)
    0 references
    0 references
    0 references
    25 January 2021
    0 references
    closest pair
    0 references
    monochromatic
    0 references
    bichromatic
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references