{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:50:53Z","timestamp":1765039853446},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3850,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0304-3975(02)00317-1","type":"journal-article","created":{"date-parts":[[2003,2,4]],"date-time":"2003-02-04T20:51:53Z","timestamp":1044391913000},"page":"1815-1828","source":"Crossref","is-referenced-by-count":18,"title":["A probabilistic analysis of randomly generated binary constraint satisfaction problems"],"prefix":"10.1016","volume":"290","author":[{"given":"Martin","family":"Dyer","sequence":"first","affiliation":[]},{"given":"Alan","family":"Frieze","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Molloy","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00317-1_BIB1","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/0097-3165(78)90059-6","article-title":"The asymptotic number of labelled graphs with given degree sequence","volume":"24","author":"Bender","year":"1978","journal-title":"J. Combin. Theory A"},{"key":"10.1016\/S0304-3975(02)00317-1_BIB2","unstructured":"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)."},{"key":"10.1016\/S0304-3975(02)00317-1_BIB3","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0195-6698(80)80030-8","article-title":"A probabilistic proof of an asymptotic formula for the number of labelled regular graphs","volume":"1","author":"Bollob\u00e1s","year":"1980","journal-title":"Euro. J. Combin."},{"key":"10.1016\/S0304-3975(02)00317-1_BIB4","series-title":"Encyclopedia of Artificial Intelligence","first-page":"276","article-title":"Constraint networks","author":"Dechter","year":"1992"},{"key":"10.1016\/S0304-3975(02)00317-1_BIB5","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/322290.322292","article-title":"A sufficient condition for backtrack-free search","volume":"29","author":"Freuder","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(02)00317-1_BIB6","series-title":"Random Graphs","author":"Janson","year":"2000"},{"key":"10.1016\/S0304-3975(02)00317-1_BIB7","series-title":"Encyclopedia of Artificial Intelligence","first-page":"285","article-title":"Constraint satisfaction","author":"Mackworth","year":"1992"},{"key":"10.1016\/S0304-3975(02)00317-1_BIB8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1006\/jctb.1996.0036","article-title":"Sudden emergence of a giant k-core in a random graph","volume":"67","author":"Pittel","year":"1996","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0304-3975(02)00317-1_BIB9","unstructured":"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.)"},{"key":"10.1016\/S0304-3975(02)00317-1_BIB10","series-title":"The Psychology of Computer Vision","first-page":"19","article-title":"Understanding line drawings of scenes with shadows","author":"Waltz","year":"1975"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502003171?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502003171?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T15:21:10Z","timestamp":1555168870000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502003171"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0304397502003171"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00317-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}