On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy (Q3448844): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Subexponential Algorithms for Unique Games and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander flows, geometric embeddings and graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypercontractivity, sum-of-squares proofs, and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum of Squares Lower Bounds from Pairwise Independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding Semidefinite Programming Hierarchies via Global Correlation / rank
 
Normal rank
Property / cites work
 
Property / cites work: MaxMin allocation via degree lower-bounded arborescences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the Lasserre Ranks of Some Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Guarantees through Higher Levels of SDP Hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Relaxations and Integrality Gaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Sell Hyperedges: The Hypermatching Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theta Bodies for Polynomial Ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Positivstellensatz proofs for the knapsack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Null- and Positivstellensatz proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4902474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on the Size of Semidefinite Programming Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability and proof complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Class of global minimum bounds of polynomial functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSP gaps and reductions in the lasserre hierarchy / rank
 
Normal rank

Latest revision as of 22:48, 10 July 2024

scientific article
Language Label Description Also known as
English
On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy
scientific article

    Statements

    On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy (English)
    0 references
    0 references
    0 references
    0 references
    27 October 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers