Lower Bounds on the Size of Semidefinite Programming Relaxations (Q2941550): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
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:55, 10 July 2024

scientific article
Language Label Description Also known as
English
Lower Bounds on the Size of Semidefinite Programming Relaxations
scientific article

    Statements

    Lower Bounds on the Size of Semidefinite Programming Relaxations (English)
    0 references
    0 references
    0 references
    0 references
    21 August 2015
    0 references
    approximation complexity
    0 references
    lower bounds on positive-semidefinite rank
    0 references
    polynomial optimization
    0 references
    quantum learning
    0 references
    semidefinite programming
    0 references
    sum-of-squares method
    0 references

    Identifiers