A probabilistic analysis of randomly generated binary constraint satisfaction problems

Theoretical Computer Science

Volumn 290, Issue 3, 2003, Pages 1815-1828

  Dyer, Martin ^a   Frieze, Alan ^b   Molloy, Michael ^c  

^a UNIVERSITY OF LEEDS   (United Kingdom)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; KNOWLEDGE REPRESENTATION;

BINARY CONSTRAINT SATISFACTION; CONSTRAINT RELATIONS; PROBABILISTIC ANALYSIS; RANDOM INSTANCE;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 85009204342     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00317-1     Document Type: Article

References (10)

1. [1] Bender, E.A., Canfield, E.R., The asymptotic number of labelled graphs with given degree sequence. J. Combin. Theory A 24 (1978), 296–307.
2. [2] D.G. Bobrow, M. Brady (Eds.), in: T. Hogg, B.A. Hubermann, C.P. Williams (Guest Eds.), Special Volume on Frontiers in Problem Solving: Phase Transitions and Complexity, North-Holland, Amsterdam, New York, Artificial Intelligence 81(1,2) (1996).
3. [3] Bollobás, B., A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Euro. J. Combin. 1 (1980), 311–316.
4. [4] Dechter, R., Constraint networks. Shapiro, S., (eds.) Encyclopedia of Artificial Intelligence, 2nd Edition, 1992, Wiley, New York, 276–285.
5. [5] Freuder, E.C., A sufficient condition for backtrack-free search. J. ACM 29 (1982), 24–32.
6. [6] Janson, S., Luczak, T., Ruciński, A., Random Graphs, 2000, Wiley, New York.
7. [7] Mackworth, A.K., Constraint satisfaction. Shapiro, S., (eds.) Encyclopedia of Artificial Intelligence, 2nd Edition, 1992, Wiley, New York, 285–293.
8. [8] Pittel, B., Spencer, J., Wormald, N., Sudden emergence of a giant k-core in a random graph. J. Combin. Theory B 67 (1996), 111–151.
9. [9] B.M. Smith, Constructing an asymptotic phase transition in random binary constraint satisfaction problems, Research Report 2000.02, University of Leeds, January 2000. (To appear in Theoretical Computer Science: Special Issue on NP-Hardness and Phase Transitions.).
10. [10] Waltz, D., Understanding line drawings of scenes with shadows. Winston, P.H., (eds.) The Psychology of Computer Vision, 1975, McGraw-Hill, New York, 19–91.