{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:12:09Z","timestamp":1743009129362,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540612919"},{"type":"electronic","value":"9783540684503"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61291-2_38","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:25:22Z","timestamp":1330273522000},"page":"14-25","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A new model of hard binary constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"Michael J.","family":"Dent","sequence":"first","affiliation":[]},{"given":"Robert E.","family":"Mercer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"unstructured":"P. Cheeseman, B. Kanefsky, and W. Taylor. Where the really hard problems are. In Proceedings IJCAI-91, pages 331\u2013337, 1991.","key":"2_CR1"},{"unstructured":"J. Crawford and L. Auton. Experimental results on the crossover point in satisfiability problems. In Proceedings AAAI-93, pages 21\u201327, 1993.","key":"2_CR2"},{"unstructured":"M. Dent and R. Mercer. Using local graph topology to model hard binary constraint satisfaction problems. Technical Report UWO-CSD-439, The University of Western Ontario, 1995.","key":"2_CR3"},{"unstructured":"Y. Fu. The use and abuse of statistical mechanics in computational complexity. In D. Stein, editor, Lectures in the Sciences of Complexity, pages 815\u2013826. Addison-Wesley Longman, 1989.","key":"2_CR4"},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R. Haralick","year":"1980","unstructured":"R. Haralick and G. Elliot. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263\u2013313, 1980.","journal-title":"Artificial Intelligence"},{"unstructured":"D. Mitchell, B. Selman, and H. Levesque. Hard and easy distributions of SAT problems. In Proceedings AAAI-92, pages 459\u2013465, 1992.","key":"2_CR6"},{"issue":"3","key":"2_CR7","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","volume":"9","author":"P. Prosser","year":"1993","unstructured":"P. Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9(3):268\u2013299, 1993.","journal-title":"Computational Intelligence"},{"unstructured":"P. Prosser. Binary constraint satisfaction problems: Some are harder than others. In Proceedings ECAI-94, pages 95\u201399, 1994.","key":"2_CR8"},{"doi-asserted-by":"crossref","unstructured":"P. Prosser. An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 1996. To appear.","key":"2_CR9","DOI":"10.1016\/0004-3702(95)00048-8"},{"unstructured":"B. Smith. Phase transition and the mushy region in constraint satisfaction problems. In Proceedings ECAI-94, 1994.","key":"2_CR10"},{"doi-asserted-by":"crossref","unstructured":"B. Smith and M. Dyer. Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 1996. To appear.","key":"2_CR11","DOI":"10.1016\/0004-3702(95)00052-6"},{"unstructured":"E. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.","key":"2_CR12"},{"unstructured":"C. Williams and T. Hogg. Using deep structure to locate hard problems. In Proceedings AAAI-92, pages 472\u2013477, 1992.","key":"2_CR13"},{"doi-asserted-by":"crossref","unstructured":"C. Williams and T. Hogg. Extending deep structure. In Proceedings AAAI-93, pages 152\u2013157, 1993.","key":"2_CR14","DOI":"10.1111\/j.1949-8594.1993.tb12214.x"}],"container-title":["Lecture Notes in Computer Science","Advances in Artifical Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61291-2_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:25:30Z","timestamp":1558254330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61291-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540612919","9783540684503"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-61291-2_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"3 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}