Skip to main content
Springer Nature Link
Log in

The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems

  • Conference paper
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (RANDOM 2003, APPROX 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2764))

  • 1086 Accesses

Abstract

We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models are robust in the sense that they exhibit a non-trivial threshold of satisfiability, and we determine the asymptotic order of that threshold. We also provide resolution complexity lower bounds for these models.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Achlioptas, D., Beame, P., Molloy, M.: A sharp threshold in proof complexity. In: Proceedings of STOC, pp. 337–346 (2001)

    Google Scholar 

  2. Achlioptas, D., Kirousis, L., Kranakis, E., Krizanc, D., Molloy, M., Stamatiou, Y.: Random constraint satisfaction: a more accurate picture. Constraints 6, 324–329 (2001); Conference version in Proceedings of CP 1997, 107–120

    Google Scholar 

  3. Beame, P., Culberson, J., Mitchell, D.: The resolution complexity of random graph k-colourability (in preparation)

    Google Scholar 

  4. Beame, P., Pitassi, T.: Simplified and improved resolution lower bounds. In: Proceedings of FOCS, pp. 274–282 (1996)

    Google Scholar 

  5. Beame, P., Karp, R., Pitassi, T., Saks, M.: The efficiency of resolution and Davis- Putnam procedures. In: Proceedings of STOC 1998 and SIAM Journal on Computing, vol. 31, pp. 1048–1075 (2002)

    Google Scholar 

  6. Ben-Sasson, E., Wigderson, A.: Short proofs are narrow - resolution made simple. In: Proceedings of STOC 1999 and Journal of the ACM, vol. 48 (2001)

    Google Scholar 

  7. Bollobás, B.: Random graphs, 2nd edn. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  8. Bollobás, B.: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. European Journal on Combinatorics 1, 311–316 (1980)

    MATH  Google Scholar 

  9. Bender, E.A., Canfield, E.R.: The asymptotic number of labelled graphs with given degree sequence. Journal of Combinatorial Theory (A) 24, 296–307 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  10. Chvatal, V., Szemeredi, E.: Many hard examples for resolution. Journal of the ACM 35, 759–768 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  11. Creignou, N., Daude, H.: Random generalized satisfiability problems. In: Proceedings of SAT (2002)

    Google Scholar 

  12. Dechter, R.: Constraint networks. In: Shapiro, S. (ed.) Encyclopedia of Artificial Intelligence, 2nd edn., pp. 276–285. Wiley, New York (1992)

    Google Scholar 

  13. Dyer, M., Frieze, A., Molloy, M.: A probabilistic analysis of randomly generated binary constraint satisfaction problems. Theoretical Computer Scince 290, 1815–1828 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  14. Freuder, E.C.: A sufficient condition for backtrack-free search. Journal of the ACM 29, 24–32 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  15. Bobrow, D.G., Brady, M. (eds.): Special Volume on Frontiers in Problem Solving: Phase Transitions and Complexity; Hogg, T., Hubermann, B.A., Williams, C.( Guest eds.): Artificial Intelligence 81(1-2) (1996)

    Google Scholar 

  16. Gent, I., MacIntyre, E., Prosser, P., Smith, B., Walsh, T.: Random constraint satisfaction: flaws and structure. Constraints 6, 345–372 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  17. Janson, S., Łuczak, T., Ruciński, A.: Random Graphs. Wiley, Chichester (2000)

    MATH  Google Scholar 

  18. Mackworth, A.K.: Constraint satisfaction. In: Shapiro, S. (ed.) Encyclopedia of Artificial Intelligence, 2nd edn., pp. 285–293. Wiley, New York (1992)

    Google Scholar 

  19. Mitchell, D.: The Resolution complexity of random constraints. In: Van Hentenryck, P. (ed.) CP (2002)

    Google Scholar 

  20. Mitchell, D.: The Resolution Complexity of Constraint Satisfaction. Ph.D. Thesis, University of Toronto (2002)

    Google Scholar 

  21. Molloy, M.: Models for Random Constraint Satisfaction Problems. In: Proceedings of STOC 2002, pp. 209–217 (2002); Longer version to appear in SIAM J. Computing

    Google Scholar 

  22. Molloy, M.: When does the giant component bring unsatisfiability? (submitted)

    Google Scholar 

  23. Molloy, M., Salavatipour, M.: The resolution complexity of random constraint satisfaction problems (submitted)

    Google Scholar 

  24. Pittel, B., Spencer, J., Wormald, N.: Sudden emergence of a giant k-core in a random graph. Journal of Combinatorial Theory (B) 67, 111–151 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  25. Talagrand, M.: Concentration of mesure and isoperimetric inequalities. Inst. Hautes Études Sci. Publ. Math. 81, 73–205 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  26. Waltz, D.: Understanding line drawings of scenes with shadows. In: Waltz, D. (ed.) The Psychology of Computer Vision, pp. 19–91. McGraw-Hill, New York (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, 15213, USA

    Alan Frieze

  2. Department of Computer Science, University of Toronto, Toronto, Ontario, M5S 3G4

    Michael Molloy

  3. Microsoft Research, Redmond, WA

    Michael Molloy

Authors
  1. Alan Frieze
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Molloy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Princeton University, 35 Olden Street, 08540, Princeton, NJ

    Sanjeev Arora

  2. Institute for Computer Science, University of Kiel, Olshausenstrasse 40, 24118, Kiel, Germany

    Klaus Jansen

  3. Battelle Bâtiment A, Centre Universitaire d’Informatique, Route de Drize 7, 1227, Carouge, Geneva, Switzerland

    José D. P. Rolim

  4. University of California, Los Angeles

    Amit Sahai

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Frieze, A., Molloy, M. (2003). The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds) Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques. RANDOM APPROX 2003 2003. Lecture Notes in Computer Science, vol 2764. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45198-3_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45198-3_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40770-6

  • Online ISBN: 978-3-540-45198-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics