Skip to main content
SpringerLink
Log in
Book cover

International Computer Science Symposium in Russia

CSR 2013: Computer Science – Theory and Applications pp 1–11Cite as

The Lovász Local Lemma – A Survey

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7913))

Abstract

The Local Lemma of Lovász has affected multiple sciences. We survey its impact on mathematics, computer science and statistical physics.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N.: A parallel algorithmic version of the Local Lemma. In: FOCS, pp. 586–593 (1991)

    Google Scholar 

  2. Alon, N., Grytczuk, J., Haluszczak, M., Riordan, O.: Nonrepetitive colorings of graphs. Random Struct. Algorithms 21(3-4), 336–346 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. Alon, N., McDiarmid, C., Reed, B.A.: Acyclic coloring of graphs. Random Struct. Algorithms 2(3), 277–288 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  4. Ambainis, A., Kempe, J., Sattath, O.: A quantum lovász local lemma. In: STOC, pp. 151–160 (2010)

    Google Scholar 

  5. Beck, J.: An algorithmic approach to the Lovász Local Lemma. i. Random Struct. Algorithms 2(4), 343–366 (1991)

    Article  MATH  Google Scholar 

  6. Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness and satisfiability of bounded occurrence instances of sat. Electronic Colloquium on Computational Complexity (ECCC) 10(022) (2003)

    Google Scholar 

  7. Bissacot, R., Fernandez, R., Procacci, A., Scoppola, B.: Combinatorics Probability and Computing 20(5), 709–719 (2011)

    Google Scholar 

  8. Chandrasekaran, K., Goyal, N., Haeupler, B.: Deterministic algorithms for the lovász local lemma. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 992–1004. Society for Industrial and Applied Mathematics, Philadelphia (2010)

    Google Scholar 

  9. Czumaj, A., Scheideler, C.: Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász Local Lemma. In: SODA, pp. 30–39 (2000)

    Google Scholar 

  10. Dujmovic, V., Joret, G., Wood, D.R.: Nonrepetitive colouring via entropy compression. CoRR abs/1112.5524 (2011)

    Google Scholar 

  11. Erdös, P., Lovász, L.: Problems and results on 3-chromatic hypergraphs and some related questions. In: Hajnal, A., Rado, R., Sós, V.T. (eds.) Infinite and Finite Sets (to Paul Erdös on his 60th birthday), pp. 609–627 (1975)

    Google Scholar 

  12. Erdös, P., Spencer, J.: Lopsided Lovász Local Lemma and latin transversals. Discrete Applied Mathematics 30(2-3), 151–154 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gebauer, H.: Disproof of the neighborhood conjecture with implications to sat. Combinatorica 32(5), 573–587 (2012)

    Article  MathSciNet  Google Scholar 

  14. Gebauer, H., Moser, R.A., Scheder, D., Welzl, E.: The lovász local lemma and satisfiability. In: Albers, S., Alt, H., Näher, S. (eds.) Efficient Algorithms. LNCS, vol. 5760, pp. 30–54. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  15. Gebauer, H., Szabó, T., Tardos, G.: The local lemma is tight for sat. In: SODA, pp. 664–674 (2011)

    Google Scholar 

  16. Guttmann, A.J.: Comment: Comment on the exact location of partition function zeros, a new method for statistical mechanics. Journal of Physics A Mathematical General 20, 511–512 (1987)

    Article  MathSciNet  Google Scholar 

  17. Haeupler, B., Saha, B., Srinivasan, A.: New constructive aspects of the lovász local lemma. In: Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010, pp. 397–406. IEEE Computer Society, Washington, DC (2010), http://dx.doi.org/10.1109/FOCS.2010.45

    Chapter  Google Scholar 

  18. Hoory, S., Szeider, S.: A note on unsatisfiable k-cnf formulas with few occurrences per variable. SIAM J. Discrete Math. 20(2), 523–528 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  19. Kolipaka, K.B.R., Szegedy, M.: Moser and Tardos meet Lovász. In: STOC, pp. 235–244 (2011)

    Google Scholar 

  20. Kolipaka, K., Szegedy, M., Xu, Y.: A sharper local lemma with improved applications. In: Gupta, A., Jansen, K., Rolim, J., Servedio, R. (eds.) APPROX/RANDOM 2012. LNCS, vol. 7408, pp. 603–614. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  21. Kratochvíl, J., Savický, P., Tuza, Z.: One more occurrence of variables makes satisfiability jump from trivial to np-complete. SIAM J. Comput. 22(1), 203–210 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  22. Molloy, M., Reed, B.A.: Further algorithmic aspects of the Local Lemma. In: STOC, pp. 524–529 (1998)

    Google Scholar 

  23. Moser, R.A.: A constructive proof of the Lovász Local Lemma. In: STOC, pp. 343–350 (2009)

    Google Scholar 

  24. Moser, R.A., Tardos, G.: A constructive proof of the general Lovász Local Lemma. J. ACM 57(2) (2010)

    Google Scholar 

  25. Papadimitriou, C.H.: On selecting a satisfying truth assignment (extended abstract). In: FOCS, pp. 163–169 (1991)

    Google Scholar 

  26. Pegden, W.: Highly nonrepetitive sequences: Winning strategies from the local lemma. Random Struct. Algorithms 38(1-2), 140–161 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  27. Pegden, W.: The lefthanded local lemma characterizes chordal dependency graphs. Random Struct. Algorithms 41(4), 546–556 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  28. Savický, P., Sgall, J.: Dnf tautologies with a limited number of occurrences of every variable. Theor. Comput. Sci. 238(1-2), 495–498 (2000)

    Article  MATH  Google Scholar 

  29. Schöning, U.: A probabilistic algorithm for k-sat and constraint satisfaction problems. In: FOCS, pp. 410–414 (1999)

    Google Scholar 

  30. Scott, A.D., Sokal, A.D.: On dependency graphs and the lattice gas. Combinatorics, Probability & Computing 15(1-2), 253–279 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  31. Shearer, J.B.: On a problem of Spencer. Combinatorica 5(3), 241–245 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  32. Spencer, J.: Asymptotic lower bounds for Ramsey functions. Discrete Mathematics 20(0), 69–76 (1977)

    Article  MathSciNet  Google Scholar 

  33. Srinivasan, A.: Improved algorithmic versions of the Lovász Local Lemma. In: SODA, pp. 611–620 (2008)

    Google Scholar 

  34. Todo, S.: Transfer-matrix study of negative-fugacity singularity of hard-core lattice gas. International Journal of Modern Physics C 10, 517–529 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  35. Wood, D.W.: The exact location of partition function zeros, a new method for statistical mechanics. Journal of Physics A: Mathematical and General 18(15), L917 (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Rutgers University, Piscataway, NJ, USA

    Mario Szegedy

Authors
  1. Mario Szegedy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing Science, Simon Fraser University, 8888 University Drive, V5A 1S6, Burnaby, BC, Canada

    Andrei A. Bulatov

  2. Institute of Mathematics and Computer Science, Ural Federal University, 51 Lenina Ave., 620083, Ekaterinburg, Russia

    Arseny M. Shur

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Szegedy, M. (2013). The Lovász Local Lemma – A Survey. In: Bulatov, A.A., Shur, A.M. (eds) Computer Science – Theory and Applications. CSR 2013. Lecture Notes in Computer Science, vol 7913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38536-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38536-0_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38535-3

  • Online ISBN: 978-3-642-38536-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation