On the Complexity of Closest Pair via Polar-Pair of Point-Sets (Q3122310): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Equilateral sets in \(l_p^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding into rectilinear spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional divide-and-conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140384 / 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: A few applications of negative-type inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the contact dimensions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominance Product and High-Dimensional Closest Pair under L_infty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / 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: Class of constructive asymptotically good algebraic codes / 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: Equilateral dimension of the rectilinear space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space graphs and sphericity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contact patterns of equal nonoverlapping spheres / 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: Q4164569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of approximate nearest neighbor search / 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: Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains / rank
 
Normal rank

Revision as of 19:35, 18 July 2024

scientific article
Language Label Description Also known as
English
On the Complexity of Closest Pair via Polar-Pair of Point-Sets
scientific article

    Statements

    On the Complexity of Closest Pair via Polar-Pair of Point-Sets (English)
    0 references
    0 references
    0 references
    0 references
    20 March 2019
    0 references
    contact-dimension
    0 references
    sphericity
    0 references
    closest pair
    0 references
    fine-grained complexity
    0 references

    Identifiers

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