{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T09:38:07Z","timestamp":1768556287304,"version":"3.49.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1016\/0004-3702(94)90088-4","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T13:02:52Z","timestamp":1047646972000},"page":"359-377","source":"Crossref","is-referenced-by-count":73,"title":["The hardest constraint problems: A double phase transition"],"prefix":"10.1016","volume":"69","author":[{"given":"Tad","family":"Hogg","sequence":"first","affiliation":[]},{"given":"Colin P.","family":"Williams","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(94)90088-4_BIB1","year":"1965"},{"key":"10.1016\/0004-3702(94)90088-4_BIB2","author":"Bollobas","year":"1985"},{"key":"10.1016\/0004-3702(94)90088-4_BIB3","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(94)90088-4_BIB4","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(94)90088-4_BIB5","article-title":"Easy problems are sometimes hard","author":"Gent","year":"1993"},{"key":"10.1016\/0004-3702(94)90088-4_BIB6","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(94)90088-4_BIB7","series-title":"Proceedings AAAI-94","article-title":"Expected gains from parallelizing constraint solving for hard problems","author":"Hogg","year":"1994"},{"issue":"3","key":"10.1016\/0004-3702(94)90088-4_BIB8","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."},{"key":"10.1016\/0004-3702(94)90088-4_BIB9","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(94)90088-4_BIB10","series-title":"Proceedings Second DIMACS Challenge","article-title":"Experiments with parallel graph coloring heuristics","author":"Lewandowski","year":"1993"},{"key":"10.1016\/0004-3702(94)90088-4_BIB11","series-title":"Proceedings AAAI-90","first-page":"17","article-title":"Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method","author":"Minton","year":"1990"},{"key":"10.1016\/0004-3702(94)90088-4_BIB12","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(94)90088-4_BIB13","author":"Palmer","year":"1985"},{"issue":"3","key":"10.1016\/0004-3702(94)90088-4_BIB14","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1119\/1.16497","article-title":"Random multiplicative processes: An elementary tutorial","volume":"58","author":"Redner","year":"1990","journal-title":"Am. J. Phys."},{"key":"10.1016\/0004-3702(94)90088-4_BIB15","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(94)90088-4_BIB16","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(94)90088-4_BIB17","series-title":"Proceedings AAAI-93","first-page":"152","article-title":"Extending deep structure","author":"Williams","year":"1993"},{"key":"10.1016\/0004-3702(94)90088-4_BIB18","doi-asserted-by":"crossref","DOI":"10.1016\/0004-3702(94)90104-X","article-title":"Exploiting the deep structure of constraint problems","author":"Williams","year":"1994","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)90088-4_BIB19","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:0004370294900884?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370294900884?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T00:56:24Z","timestamp":1553648184000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370294900884"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0004370294900884"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(94)90088-4","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}