Tight rank lower bounds for the Sherali-Adams proof system (Q1019183): Difference between revisions

@@ Property / cites work @@
+Q3274590
@@ Property / cites work: Q3274590 / rank @@
+Normal rank
@@ Property / cites work @@
+Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint)
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+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 @@
+Q3549627
@@ Property / cites work: Q3549627 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the pigeonhole principle
@@ Property / cites work: The complexity of the pigeonhole principle / rank @@
+Normal rank
@@ Property / cites work @@
+The intractability of resolution
@@ Property / cites work: The intractability of resolution / rank @@
+Normal rank
@@ Property / cites work @@
+Q4736859
@@ Property / cites work: Q4736859 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002766
@@ Property / cites work: Q3002766 / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász–Schrijver Procedures
+Normal rank
@@ Property / cites work @@
+Rank Lower Bounds for the Sherali-Adams Operator
@@ Property / cites work: Rank Lower Bounds for the Sherali-Adams Operator / rank @@
+Normal rank
@@ Property / cites work @@
+Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy
+Normal rank
@@ Property / cites work @@
+Resolution Width and Cutting Plane Rank Are Incomparable
+Normal rank