{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:29:49Z","timestamp":1752460189850},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540652243"},{"type":"electronic","value":"9783540494812"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49481-2_24","type":"book-chapter","created":{"date-parts":[[2007,11,24]],"date-time":"2007-11-24T14:46:10Z","timestamp":1195915570000},"page":"325-339","source":"Crossref","is-referenced-by-count":34,"title":["Random Constraint Satisfaction: theory meets practice"],"prefix":"10.1007","author":[{"given":"Ewan","family":"MacIntyre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Prosser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,6,11]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"D. Achlioptas, L.M. Kirousis, E. Kranakis, D. Krizanc, M.S.O. Molloy, and C. Stamatiou. Random constraint satisfaction: A more accurate picture. In Proceedings of Third International Conference on Principles and Practice of Constraint Programming (CP97), pages 107\u2013120, 1997.","DOI":"10.1007\/BFb0017433"},{"key":"24_CR2","unstructured":"P. Cheeseman, B. Kanefsky, and W.M. Taylor. Where the really hard problems are. In Proceedings of the 12th IJCAI, pages 331\u2013337. International Joint Conference on Artificial Intelligence, 1991."},{"key":"24_CR3","unstructured":"E. Friedgut. Sharp thresholds for graph properties and the k-SAT problem, 1998. Unpublished manuscrip."},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1006\/jagm.1996.0016","volume":"20","author":"A. Frieze","year":"1996","unstructured":"A. Frieze and S. Suen. Analysis of two simple heuristics on a random instance of k-SAT. Journal of Algorithms, 20:312\u2013355, 1996.","journal-title":"Journal of Algorithms"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"I.P. Gent, E. MacIntyre, P. Prosser, P. Shaw, and T. Walsh. The constrainedness of arc consistency. In 3rd International Conference on Principles and Practices of Constraint Programming (CP-97), pages 327\u2013340. Springer, 1997.","DOI":"10.1007\/BFb0017449"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"I.P. Gent, E. MacIntyre, P. Prosser, B.M. Smith, and T. Walsh. An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem. In 2nd International Conference on Principles and Practices of Constraint Programming (CP-96), pages 179\u2013193, 1996.","DOI":"10.1007\/3-540-61551-2_74"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"I.P. Gent, E. MacIntyre, P. Prosser, and T. Walsh. Scaling effects in the CSP phase transition. In 1st International Conference on Principles and Practices of Constraint Programming (CP-95), pages 70\u201387. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60299-2_5"},{"key":"24_CR8","unstructured":"I.P. Gent, E. MacIntyre, P. Prosser, and T. Walsh. The constrainedness of search. In Proceedings of the 13th National Conference on AI, pages 246\u2013252. American Association for Artificial Intelligence, 1996."},{"key":"24_CR9","unstructured":"I.P. Gent, E. MacIntyre, P. Prosser, and T. Walsh. The scaling of search cost. In Proceedings of the 14th National Conference on AI, pages 315\u2013320. American Association for Artificial Intelligence, 1997."},{"key":"24_CR10","unstructured":"I.P. Gent and T. Walsh. Phase transitions from real computational problems. In Proceedings of the 8th International Symposium on Artificial Intelligence, pages 356\u2013364, 1995."},{"key":"24_CR11","unstructured":"C. Gomes and B. Selman. Problem structure in the presence of perturbations. In Proceedings of the 14th National Conference on AI, pages 221\u2013226. American Association for Artificial Intelligence, 1997."},{"key":"24_CR12","unstructured":"S. Grant and B.M. Smith. The phase transition behaviour of maintaining arc consistency. Research Report 95.25 School of Computer Studies University of Leeds1995. A revised and shortened version appears in Proceedings of 12th ECAI, pages 175\u2013179, 1996."},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"L.M. Kirousis, E. Kranakis, and D. Krizanc. Approximating the unsatisfiability threshold of random formulas. In Proceedings of the 4th Annual European Symposium on Algorithms (ESA\u201996), pages 27\u201338, 1996.","DOI":"10.1007\/3-540-61680-2_44"},{"key":"24_CR14","unstructured":"D. Mitchell, B. Selman, and H. Levesque. Hard and Easy Distributions of SAT Problems. In Proceedings of the 10th National Conference on AI, pages 459\u2013465. American Association for Artificial Intelligence, 1992."},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0004-3702(94)90104-X","volume":"70","author":"C. Williams","year":"1994","unstructured":"C. Williams and T. Hogg. Exploiting the deep structure of constraint problems. Artificial Intelligence, 70:73\u2013117, 1994.","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49481-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T22:05:12Z","timestamp":1557007512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49481-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540652243","9783540494812"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-49481-2_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}