{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T00:56:18Z","timestamp":1773536178654,"version":"3.50.1"},"reference-count":25,"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)00056-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:37:38Z","timestamp":1027625858000},"page":"273-295","source":"Crossref","is-referenced-by-count":76,"title":["Critical behavior in the computational cost of satisfiability testing"],"prefix":"10.1016","volume":"81","author":[{"given":"Bart","family":"Selman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott","family":"Kirkpatrick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(95)00056-9_BIB1","unstructured":"A. Baker, Intelligent backtracking on the hardest constraint problems, J. Artif. Intell. Res. (to appear)."},{"key":"10.1016\/0004-3702(95)00056-9_BIB2","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/0004-3702(95)00056-9_BIB3","article-title":"Report on a SAT competition","author":"Buro","year":"1992"},{"key":"10.1016\/0004-3702(95)00056-9_BIB4","series-title":"Proceedings IJCAI-91","first-page":"163","article-title":"Where the really hard problems are","author":"Cheeseman","year":"1991"},{"issue":"5035","key":"10.1016\/0004-3702(95)00056-9_BIB5","doi-asserted-by":"crossref","first-page":"1181","DOI":"10.1126\/science.254.5035.1181","article-title":"Cooperative solution of constraint satisfaction problems","volume":"254","author":"Clearwater","year":"1991","journal-title":"Science"},{"key":"10.1016\/0004-3702(95)00056-9_BIB6","series-title":"Proceedings AAAI-93","article-title":"Experimental results on the crossover point in satisfiability problems","author":"Crawford","year":"1993"},{"key":"10.1016\/0004-3702(95)00056-9_BIB7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","article-title":"A computing procedure for quantification theory","volume":"7","author":"Davis","year":"1960","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(95)00056-9_BIB8","author":"Fischer","year":"1991"},{"key":"10.1016\/0004-3702(95)00056-9_BIB9","series-title":"Easy problems are sometimes hard. The DIMACS Challenge on Satisfiability Testing","author":"Gent","year":"1993"},{"key":"10.1016\/0004-3702(95)00056-9_BIB10","volume":"279","author":"Goldstein","year":"1976"},{"key":"10.1016\/0004-3702(95)00056-9_BIB11","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)00056-9_BIB12","series-title":"Expected gains from parallelizing constraint solving for hard problems","author":"Hogg","year":"1994"},{"key":"10.1016\/0004-3702(95)00056-9_BIB13","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1002\/rsa.3240040303","article-title":"The birth of the giant component","volume":"4","author":"Janson","year":"1993","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/0004-3702(95)00056-9_BIB14","series-title":"The DIMACS Challenge on Satisfiability Testing","author":"Johnson","year":"1993"},{"key":"10.1016\/0004-3702(95)00056-9_BIB15","first-page":"439","volume":"6","author":"Kirkpatrick","year":"1993"},{"key":"10.1016\/0004-3702(95)00056-9_BIB16","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1126\/science.264.5163.1297","article-title":"Critical behavior in the satisfiability of random Boolean expressions","volume":"264","author":"Kirkpatrick","year":"1994","journal-title":"Science"},{"key":"10.1016\/0004-3702(95)00056-9_BIB17","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1145\/3341.3344","article-title":"Statistical mechanics and disordered systems","volume":"28","author":"Kirkpatrick","year":"1985","journal-title":"Commun. ACM"},{"key":"10.1016\/0004-3702(95)00056-9_BIB18","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1103\/PhysRevA.40.1045","article-title":"Scaling Concepts in Glasses","volume":"40","author":"Kirkpatrick","year":"1989","journal-title":"Phys. Rev. A"},{"key":"10.1016\/0004-3702(95)00056-9_BIB19","volume":"Vol. 2","author":"Knuth","year":"1981"},{"key":"10.1016\/0004-3702(95)00056-9_BIB20","series-title":"Proceedings AAAI Spring Symposium on AI and NP-Hard Problems","article-title":"Evidence for a satisfiability threshold for random 3CNF formulas","author":"Larrabee","year":"1993"},{"key":"10.1016\/0004-3702(95)00056-9_BIB21","author":"M\u00e9zard","year":"1986"},{"key":"10.1016\/0004-3702(95)00056-9_BIB22","series-title":"Proceedings AAAI-92","first-page":"456","article-title":"Hard and easy distributions of SAT problems","author":"Mitchell","year":"1992"},{"key":"10.1016\/0004-3702(95)00056-9_BIB23","series-title":"Proceedings AAAI-92","first-page":"440","article-title":"GSAT: a new method for solving hard satisfiability problems","author":"Selman","year":"1992"},{"key":"10.1016\/0004-3702(95)00056-9_BIB24","doi-asserted-by":"crossref","first-page":"1756","DOI":"10.1103\/PhysRevLett.48.1756","volume":"48","author":"Soukoulis","year":"1982","journal-title":"Phys. Rev. Lett."},{"key":"10.1016\/0004-3702(95)00056-9_BIB25","author":"Spencer","year":"1987"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000569?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000569?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T17:56:56Z","timestamp":1555523816000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370295000569"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0004370295000569"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(95)00056-9","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}