{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T14:04:55Z","timestamp":1777125895227,"version":"3.51.4"},"reference-count":47,"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)00050-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:24:09Z","timestamp":1027643049000},"page":"127-154","source":"Crossref","is-referenced-by-count":38,"title":["Refining the phase transition in combinatorial search"],"prefix":"10.1016","volume":"81","author":[{"given":"Tad","family":"Hogg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(95)00050-X_BIB1","author":"Berge","year":"1973"},{"key":"10.1016\/0004-3702(95)00050-X_BIB2","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/0004-3702(95)00050-X_BIB3","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1146\/annurev.so.06.080180.000455","article-title":"Models of network structure","volume":"6","author":"Burt","year":"1980","journal-title":"Annual Rev. Social."},{"key":"10.1016\/0004-3702(95)00050-X_BIB4","series-title":"Proceedings IJCAI-91","first-page":"331","article-title":"Where the really hard problems are","author":"Cheeseman","year":"1991"},{"issue":"2","key":"10.1016\/0004-3702(95)00050-X_BIB5","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1137\/0221022","article-title":"Heuristic sampling: a method for predicting the performance of tree searching programs","volume":"21","author":"Chen","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0004-3702(95)00050-X_BIB6","series-title":"Proceedings AAAI-94","first-page":"1310","article-title":"Exploiting problem structure in genetic algorithms","author":"Clearwater","year":"1994"},{"key":"10.1016\/0004-3702(95)00050-X_BIB7","series-title":"Proceedings AAAI-93","first-page":"21","article-title":"Experimental results on the cross-over point in satisfiability problems","author":"Crawford","year":"1993"},{"key":"10.1016\/0004-3702(95)00050-X_BIB8","series-title":"Proceedings ACM Symposium on Applied Computing (SAC93)","article-title":"Asynchronous organizations for multi-algorithm problems","author":"de Souza","year":"1993"},{"key":"10.1016\/0004-3702(95)00050-X_BIB9","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(90)90046-3","article-title":"Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition","volume":"41","author":"Dechter","year":"1990","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00050-X_BIB10","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0196-6774(89)90001-1","article-title":"The solution of some random NP-hard problems in polynomial expected time","volume":"10","author":"Dyer","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/0004-3702(95)00050-X_BIB11","series-title":"Proceedings IJCAI-93","first-page":"254","article-title":"Using inferred disjunctive constraints to decompose constraint satisfaction problems","author":"Freuder","year":"1993"},{"key":"10.1016\/0004-3702(95)00050-X_BIB12","author":"Garey","year":"1979"},{"key":"10.1016\/0004-3702(95)00050-X_BIB13","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0004-3702(94)90109-0","article-title":"Easy problems are sometimes hard","volume":"70","author":"Gent","year":"1994","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00050-X_BIB14","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-58467-6_31","article-title":"The hardest random SAT problems","author":"Gent","year":"1994"},{"key":"10.1016\/0004-3702(95)00050-X_BIB15","doi-asserted-by":"crossref","first-page":"1140","DOI":"10.1080\/01621459.1967.10500922","article-title":"Representation of similarity matrices by trees","volume":"62","author":"Hartigan","year":"1967","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/0004-3702(95)00050-X_BIB16","series-title":"Phase transitions in constraint satisfaction search","author":"Hogg","year":"1994"},{"key":"10.1016\/0004-3702(95)00050-X_BIB17","series-title":"Proceedings AAAI-93","first-page":"231","article-title":"Solving the really hard problems with cooperative search","author":"Hogg","year":"1993"},{"key":"10.1016\/0004-3702(95)00050-X_BIB18","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0004-3702(94)90088-4","article-title":"The hardest constraint problems: a double phase transition","volume":"69","author":"Hogg","year":"1994","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00050-X_BIB19","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0004-3702(87)90033-6","article-title":"Phase transitions in artificial intelligence systems","volume":"33","author":"Huberman","year":"1987","journal-title":"Artif. Intell."},{"issue":"3","key":"10.1016\/0004-3702(95)00050-X_BIB20","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","article-title":"Optimization by simulated annealing: an experimental evaluation, Part II: graph coloring and number partitioning","volume":"39","author":"Johnson","year":"1991","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/0004-3702(95)00050-X_BIB21","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1137\/0914041","article-title":"A parallel graph coloring heuristic","volume":"14","author":"Jones","year":"1993","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/0004-3702(95)00050-X_BIB22","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/0004-3702(95)00050-X_BIB23","series-title":"AAAI Spring Symposium on AI and NP-Hard Problems","first-page":"112","article-title":"Evidence for a satisfiability threshold for random 3CNF formulas","author":"Larrabee","year":"1993"},{"key":"10.1016\/0004-3702(95)00050-X_BIB24","series-title":"Proceedings 2nd DIMACS Challenge","article-title":"Experiments with parallel graph coloring heuristics","author":"Lewandowski","year":"1993"},{"key":"10.1016\/0004-3702(95)00050-X_BIB25","series-title":"Encyclopedia of AI","first-page":"205","article-title":"Constraint satisfaction","author":"Mackworth","year":"1987"},{"key":"10.1016\/0004-3702(95)00050-X_BIB26","series-title":"Proceedings AAAI-90","first-page":"17","article-title":"Solving large-scale constraint satisfaction and scheduling problems using a heursitic repair method","author":"Minton","year":"1990"},{"key":"10.1016\/0004-3702(95)00050-X_BIB27","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","article-title":"Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems","volume":"58","author":"Minton","year":"1992","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00050-X_BIB28","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)00050-X_BIB29","author":"Nijenhuis","year":"1978"},{"key":"10.1016\/0004-3702(95)00050-X_BIB30","author":"Palmer","year":"1985"},{"key":"10.1016\/0004-3702(95)00050-X_BIB31","author":"Pearl","year":"1984"},{"key":"10.1016\/0004-3702(95)00050-X_BIB32","series-title":"Proceedings IJCAI93","first-page":"262","article-title":"Domain filtering can degrade intelligent backtracking search","author":"Prosser","year":"1993"},{"issue":"3","key":"10.1016\/0004-3702(95)00050-X_BIB33","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)00050-X_BIB34","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)00050-X_BIB35","series-title":"Proceedings AAAI-92","first-page":"440","article-title":"A new method for solving hard satisfiability problems","author":"Selman","year":"1992"},{"key":"10.1016\/0004-3702(95)00050-X_BIB36","author":"Simon","year":"1962"},{"key":"10.1016\/0004-3702(95)00050-X_BIB37","series-title":"Proceedings ECAI94 Workshop on Constraint Processing","first-page":"79","article-title":"In search of exceptionally difficult constraint satisfaction problems","author":"Smith","year":"1994"},{"key":"10.1016\/0004-3702(95)00050-X_BIB38","article-title":"The phase transition in constraint satisfaction problems: a closer look at the mushy region","author":"Smith","year":"1994"},{"key":"10.1016\/0004-3702(95)00050-X_BIB39","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0004-3702(77)90029-7","article-title":"Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis","volume":"9","author":"Stallman","year":"1977","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00050-X_BIB40","first-page":"265","article-title":"On the generation of random graphs with given properties and known distributions","volume":"13","author":"Tinhofer","year":"1979","journal-title":"Appl. Comput. Sci. Ber. Prakt. Inf."},{"key":"10.1016\/0004-3702(95)00050-X_BIB41","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0196-6774(88)90005-3","article-title":"Almost all k-colorable graphs are easy to color","volume":"9","author":"Turner","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/0004-3702(95)00050-X_BIB42","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)00050-X_BIB43","series-title":"Proceedings AAAI-93","first-page":"152","article-title":"Extending deep structure","author":"Williams","year":"1993"},{"issue":"3","key":"10.1016\/0004-3702(95)00050-X_BIB44","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1111\/j.1467-8640.1993.tb00307.x","article-title":"The typicality of phase transitions in search","volume":"9","author":"Williams","year":"1993","journal-title":"Comput. Intell."},{"key":"10.1016\/0004-3702(95)00050-X_BIB45","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."},{"key":"10.1016\/0004-3702(95)00050-X_BIB46","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1093\/comjnl\/12.4.317","article-title":"A technique for coloring a graph applicable to large-scale optimization problems","volume":"12","author":"Wood","year":"1969","journal-title":"Computer J."},{"key":"10.1016\/0004-3702(95)00050-X_BIB47","series-title":"Proceedings AAAI-92","first-page":"545","article-title":"An average-case analysis of branch-and-bound with applications: summary of results","author":"Zhang","year":"1992"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437029500050X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437029500050X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T06:27:33Z","timestamp":1555050453000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/000437029500050X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":47,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["000437029500050X"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(95)00050-x","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}