Q5121902 (Q5121902): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.CCC.2018.14 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: FALCONN / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LEMP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebrization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4638059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consequences of Faster Alignment of Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching Triangles and Basing Hardness on an Extremely Popular Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: More Applications of the Polynomial Method to Algorithm Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean minimum spanning trees and bichromatic closest pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Locality-Sensitive Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Data-Dependent Hashing for Approximate Near Neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Satisfiability of Small Depth Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A (slightly) faster algorithm for klee's measure problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive Filtering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapid Multiplication of Rectangular Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reliable Randomized Algorithm for the Closest-Pair Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Integer Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness for First-Order Properties on Sparse Structures with Algorithmic Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional lower bounds for space/time tradeoffs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even faster integer multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean function complexity. Advances and frontiers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Subquadratic Algorithm for Finding Outlier Correlations / 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: Higher Lower Bounds from the 3SUM Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient partition trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Range searching with efficient hierarchical cuttings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards polynomial lower bounds for dynamic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithms for the diameter and radius of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximate Maximum Inner Product Search with LEMP / 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: ON SOME FINE-GRAINED QUESTIONS IN ALGORITHMS AND COMPLEXITY / 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: Faster all-pairs shortest paths via circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding orthogonal vectors in discrete structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.CCC.2018.14 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:00, 30 December 2024

scientific article; zbMATH DE number 7250154
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7250154

    Statements

    0 references
    22 September 2020
    0 references
    maximum inner product
    0 references
    SETH
    0 references
    hardness of approximation in P
    0 references
    fined-grained complexity
    0 references
    Hopcroft's problem
    0 references
    Chinese remainder theorem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers