{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T11:21:12Z","timestamp":1768562472434,"version":"3.49.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":6355,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1016\/0004-3702(95)00052-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:24:09Z","timestamp":1027657449000},"page":"155-181","source":"Crossref","is-referenced-by-count":141,"title":["Locating the phase transition in binary constraint satisfaction problems"],"prefix":"10.1016","volume":"81","author":[{"given":"Barbara M.","family":"Smith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin E.","family":"Dyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(95)00052-6_BIB1","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/0004-3702(95)00052-6_BIB2","series-title":"Proceedings IJCAI-91","first-page":"331","article-title":"Where the Really Hard Problems are","author":"Cheeseman","year":"1991"},{"key":"10.1016\/0004-3702(95)00052-6_BIB3","series-title":"Proceedings AAAI-93","first-page":"21","article-title":"Experimental results on the crossover point in satisfiability problems","author":"Crawford","year":"1993"},{"key":"10.1016\/0004-3702(95)00052-6_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","article-title":"Network-based heuristics for constraint-satisfaction problems","volume":"34","author":"Dechter","year":"1988","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00052-6_BIB5","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","article-title":"Increasing tree search efficiency for constraint satisfaction problems","volume":"14","author":"Haralick","year":"1980","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00052-6_BIB6","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1126\/science.264.5163.1297","article-title":"Critical behaviour in the satisfiability of random Boolean expressions","volume":"264","author":"Kirkpatrick","year":"1994","journal-title":"Science"},{"key":"10.1016\/0004-3702(95)00052-6_BIB7","series-title":"Proceedings AAAI-92","first-page":"459","article-title":"Hard and easy distributions of SAT problems","author":"Mitchell","year":"1992"},{"key":"10.1016\/0004-3702(95)00052-6_BIB8","author":"Palmer","year":"1985"},{"issue":"3","key":"10.1016\/0004-3702(95)00052-6_BIB9","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","article-title":"Hybrid algorithms for the constraint satisfaction problem","volume":"9","author":"Prosser","year":"1993","journal-title":"Comput. Intell."},{"key":"10.1016\/0004-3702(95)00052-6_BIB10","series-title":"Proceedings ECAI-94","first-page":"95","article-title":"Binary constraint satisfaction problems: some are harder than others","author":"Prosser","year":"1994"},{"key":"10.1016\/0004-3702(95)00052-6_BIB11","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(95)00048-8","article-title":"An empirical study of phase transitions in binary constraint satisfaction problems","volume":"81","author":"Prosser","year":"1996","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00052-6_BIB12","author":"Tsang","year":"1993"},{"key":"10.1016\/0004-3702(95)00052-6_BIB13","series-title":"Proceedings AAAI-92","first-page":"472","article-title":"Using deep structure to locate hard problems","author":"Williams","year":"1992"},{"key":"10.1016\/0004-3702(95)00052-6_BIB14","series-title":"Proceedings AAAI-93","first-page":"152","article-title":"Extending deep structure","author":"Williams","year":"1993"},{"key":"10.1016\/0004-3702(95)00052-6_BIB15","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0004-3702(94)90104-X","article-title":"Exploiting the deep structure of constraint problems","volume":"70","author":"Williams","year":"1994","journal-title":"Artif. Intell."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000526?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000526?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T10:27:32Z","timestamp":1555064852000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370295000526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0004370295000526"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(95)00052-6","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}