Dominance Product and High-Dimensional Closest Pair under L_infty (Q5136258): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
label / enlabel / en
 
Dominance Product and High-Dimensional Closest Pair under L_infty
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.ISAAC.2017.39 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1605.08107 / 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: Multidimensional divide-and-conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric applications of a randomized optimization technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Rabin's nearest-neighbor algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of selection and ranking in X+Y and matrices with sorted columns / rank
 
Normal rank
Property / cites work
 
Property / cites work: How good is the information theory bound in sorting? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast rectangular matrix multiplication and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of tensors and fast matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing dominances in \(E^ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4164569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All pairs shortest paths using bridging sets and rectangular matrix multiplication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963852036 / rank
 
Normal rank
Property / title
 
Dominance Product and High-Dimensional Closest Pair under L_infty (English)
Property / title: Dominance Product and High-Dimensional Closest Pair under L_infty (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.ISAAC.2017.39 / rank
 
Normal rank

Latest revision as of 16:04, 30 December 2024

scientific article; zbMATH DE number 7278044
Language Label Description Also known as
English
Dominance Product and High-Dimensional Closest Pair under L_infty
scientific article; zbMATH DE number 7278044

    Statements

    0 references
    0 references
    25 November 2020
    0 references
    closest pair
    0 references
    dominance product
    0 references
    \(L_\infty\) proximity
    0 references
    rectangular matrix multiplication
    0 references
    Dominance Product and High-Dimensional Closest Pair under L_infty (English)
    0 references

    Identifiers

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