Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems (Q1947040): Difference between revisions

@@ Property / author @@
-Q386150
@@ Property / author: Q386150 / rank @@
-Normal rank
@@ Property / author @@
+Stefan S. Dantchev
@@ Property / author: Stefan S. Dantchev / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2018655187
@@ Property / OpenAlex ID: W2018655187 / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness amplification in proof complexity
@@ Property / cites work: Hardness amplification in proof complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity
+Normal rank
@@ Property / cites work @@
+Q3002766
@@ Property / cites work: Q3002766 / rank @@
+Normal rank
@@ Property / cites work @@
+Integrality gaps for Sherali-Adams relaxations
@@ Property / cites work: Integrality gaps for Sherali-Adams relaxations / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of cutting-plane proofs
@@ Property / cites work: On the complexity of cutting-plane proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549627
@@ Property / cites work: Q3549627 / rank @@
+Normal rank
@@ Property / cites work @@
+Computer Science Logic
@@ Property / cites work: Computer Science Logic / rank @@
+Normal rank
@@ Property / cites work @@
+Cutting Planes and the Parameter Cutwidth
@@ Property / cites work: Cutting Planes and the Parameter Cutwidth / rank @@
+Normal rank
@@ Property / cites work @@
+Tight rank lower bounds for the Sherali-Adams proof system
+Normal rank
@@ Property / cites work @@
+Parameterized proof complexity
@@ Property / cites work: Parameterized proof complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Sherali-Adams Gaps from Pairwise Independence
+Normal rank
@@ Property / cites work @@
+Outline of an algorithm for integer solutions to linear programs
+Normal rank
@@ Property / cites work @@
+Q4807964
@@ Property / cites work: Q4807964 / rank @@
+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 @@
+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 @@
+Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász–Schrijver Procedures
+Normal rank
@@ Property / cites work @@
+Q4934563
@@ Property / cites work: Q4934563 / rank @@
+Normal rank
@@ Property / cites work @@
+Resolution Width and Cutting Plane Rank Are Incomparable
+Normal rank
@@ Property / cites work @@
+A complexity gap for tree resolution
@@ Property / cites work: A complexity gap for tree resolution / rank @@
+Normal rank
@@ Property / cites work @@
+A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1947040