Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q2941487): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/2746539.2746594 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973046087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximate Distance Labels and Routing Schemes with Affine Stretch / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse spanners of weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Linear Time Construction of Sparse Neighborhood Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles with constant query time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Constructing t-Spanners and Paths with Stretch t / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey partitions and proximity data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5414573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path queries in static networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank

Latest revision as of 15:54, 10 July 2024

scientific article
Language Label Description Also known as
English
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
scientific article

    Statements

    Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (English)
    0 references
    0 references
    0 references
    21 August 2015
    0 references
    3SUM
    0 references
    APSP
    0 references
    CNF-SAT
    0 references
    conditional lower bounds
    0 references
    dynamic data structures
    0 references
    reductions
    0 references
    seth
    0 references
    single-source max-flow
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references