Skip to main content
Log in

Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems

computational complexity Aims and scope Submit manuscript

Abstract

We prove a dichotomy theorem for the rank of propositional contradictions, uniformly generated from first-order sentences, in both the Lovász-Schrijver (LS) and Sherali-Adams (SA) refutation systems. More precisely, we first show that the propositional translations of first-order formulae that are universally false, that is, fail in all finite and infinite models, have LS proofs whose rank is constant, independent of the size of the (finite) universe. In contrast to that, we prove that the propositional formulae that fail in all finite models, but hold in some infinite structure, require proofs whose SA rank grows polynomially with the size of the universe.

Until now, this kind of so-called complexity gap theorem has been known for tree-like Resolution and, in somehow restricted forms, for the Resolution and Nullstellensatz systems. As far as we are aware, this is the first time the Sherali-Adams lift-and-project method has been considered as a propositional refutation system (since the conference version of this paper, SA has been considered as a refutation system in several further papers). An interesting feature of the SA system is that it simulates LS, the Lovász-Schrijver refutation system without semi-definite cuts, in a rank-preserving fashion.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Paul Beame, Trinh Huynh & Toniann Pitassi (2010). Hardness amplification in proof complexity. In STOC, Leonard J. Schulman, editor, 87–96. ACM. ISBN 978-1-4503-0050-6.

  • Paul Beame, Toniann Pitassi, Nathan Segerlind (2007) Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity. SIAM J. Comput. 37(3): 845–869

    Article  MathSciNet  MATH  Google Scholar 

  • Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen & Toniann Pitassi (2006). Rank Bounds and Integrality Gaps for Cutting Planes Procedures. Theory of Computing 2(1), 65–90. http://www.theoryofcomputing.org/articles/v002a004.

  • Moses Charikar, Konstantin Makarychev & Yury Makarychev (2009). Integrality gaps for Sherali-Adams relaxations. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, 283–292.

  • Cook W., Coullard R., Turan G. (1987) On the complexity of cutting plane proofs. Discrete Applied Mathematics 18: 25–38

    Article  MathSciNet  MATH  Google Scholar 

  • S. Dantchev (2007). Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, 311–317. ACM. ISBN 978-1-59593-631-8.

  • S. Dantchev & S. Riis (2003). On Relativisation and Complexity gap for Resolution-based proof systems. In The 17th Annual Conference of the EACSL, Computer Science Logic, volume 2803 of LNCS, 142–154. Springer.

  • Stefan S. Dantchev & Barnaby Martin (2009). Cutting Planes and the Parameter Cutwidth. In CiE, 134–143.

  • Stefan S. Dantchev, Barnaby Martin, Mark Rhodes (2009) Tight rank lower bounds for the Sherali-Adams proof system. Theor. Comput. Sci. 410(21–23): 2054–2063

    Google Scholar 

  • Stefan S. Dantchev, Barnaby Martin, Stefan Szeider (2011) Parameterized proof complexity. Comput. Complex. 20(1): 51–85

    Article  Google Scholar 

  • Konstantinos Georgiou, Avner Magen, Madhur Tulsiani (2009). Optimal Sherali-Adams Gaps from Pairwise Independence. In APPROX ’09 / RANDOM ’09: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 125–139. Springer-Verlag, Berlin, Heidelberg. ISBN 978-3-642-03684-2.

  • R. Gomory (1958) Outline of an algorithm for integer solutions to linear programs. Bulletin of the AMS (64), 275–278.

  • Grigoriev D., Hirsch E. A., Pasechnik D. V. (2002) Complexity of semialgebraic proofs. Moscow Mathematical Journal 2(4): 647–679

    MathSciNet  MATH  Google Scholar 

  • Laurent M. (2003) A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0−1 programming. Mathematics of Operations Research 28(3): 470–496

    Article  MathSciNet  MATH  Google Scholar 

  • Lovász L., Schrijver A. (1991) Cones of matrices and set-functions and 0−1 optimization. SIAM Journal on Optimization 7(1): 166–190

    Article  Google Scholar 

  • Claire Mathieu & Alistair Sinclair (2009). Sherali-adams relaxations of the matching polytope. In STOC ’09: Proceedings of the 41st annual ACM symposium on Theory of computing, 293–302. ACM, New York, NY, USA. ISBN 978-1-60558-506-2.

  • Toniann Pitassi & Nathan Segerlind (2009). Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures. In SODA, 355–364.

  • P. Pudlák (1999). On the complexity of propositional calculus. In Sets and Proofs, 197–218. Cambridge University Press. Invited papers from Logic Colloquium’97.

  • Mark Rhodes (2008). Resolution Width and Cutting Plane Rank Are Incomparable. In MFCS, 575–587.

  • Riis S. (2001) A Complexity gap for tree-resolution. Computational Complexity 10: 179–209

    Article  MathSciNet  Google Scholar 

  • Søren Riis (2008). On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity. In LICS, 272–283.

  • Grant Schoenebeck (2008). Linear Level Lasserre Lower Bounds for Certain k-CSPs. In FOCS ’08: Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 593–602. IEEE Computer Society, Washington, DC, USA. ISBN 978-0-7695-3436-7.

  • Sherali H. D., Adams W. P. (1990) A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics 3: 411–430

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Barnaby Martin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dantchev, S., Martin, B. Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. comput. complex. 22, 191–213 (2013). https://doi.org/10.1007/s00037-012-0049-1

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00037-012-0049-1

Keywords

Subject classification

Navigation