Sum-of-squares rank upper bounds for matching problems (Q1631641): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-017-0169-2
@@ Property / DOI: 10.1007/s10878-017-0169-2 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-017-0169-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2751975837
@@ Property / OpenAlex ID: W2751975837 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes
+Normal rank
@@ Property / cites work @@
+Rounding sum-of-squares relaxations
@@ Property / cites work: Rounding sum-of-squares relaxations / rank @@
+Normal rank
@@ Property / cites work @@
+The matching problem has no small symmetric SDP
@@ Property / cites work: The matching problem has no small symmetric SDP / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Constraint Satisfaction Requires Large LP Relaxations
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse sums of squares on finite abelian groups and improved semidefinite lifts
+Normal rank
@@ Property / cites work @@
+When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
+Normal rank
@@ Property / cites work @@
+Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity
+Normal rank
@@ Property / cites work @@
+Q4902474
@@ Property / cites work: Q4902474 / rank @@
+Normal rank
@@ Property / cites work @@
+Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack
+Normal rank
@@ Property / cites work @@
+On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy
+Normal rank
@@ Property / cites work @@
+Global Optimization with Polynomials and the Problem of Moments
+Normal rank
@@ Property / cites work @@
+A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
+Normal rank
@@ Property / cites work @@
+Lower Bounds on the Size of Semidefinite Programming Relaxations
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+Sherali-adams relaxations of the matching polytope
+Normal rank
@@ Property / cites work @@
+Approximability and proof complexity
@@ Property / cites work: Approximability and proof complexity / rank @@
+Normal rank
@@ Property / cites work @@
+The Matching Polytope has Exponential Extension Complexity
+Normal rank
@@ Property / cites work @@
+A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
+Normal rank
@@ Property / cites work @@
+Class of global minimum bounds of polynomial functions
+Normal rank
@@ Property / cites work @@
+On a Representation of the Matching Polytope Via Semidefinite Liftings
+Normal rank
@@ Property / cites work @@
+Rank bounds for a hierarchy of Lovász and Schrijver
+Normal rank
@@ Property / cites work @@
+Expressing combinatorial optimization problems by linear programs
+Normal rank
@@ Property / DOI @@
+.1007/S10878-017-0169-2
@@ Property / DOI: 10.1007/S10878-017-0169-2 / rank @@
+Normal rank