{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T19:47:57Z","timestamp":1776109677779,"version":"3.50.1"},"reference-count":19,"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)00046-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:38Z","timestamp":1027640258000},"page":"31-57","source":"Crossref","is-referenced-by-count":157,"title":["Experimental results on the crossover point in random 3-SAT"],"prefix":"10.1016","volume":"81","author":[{"given":"James M.","family":"Crawford","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Larry D.","family":"Auton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(95)00046-1_BIB1","series-title":"Proceedings Fourth Annual ACM-SIAM Symposium on Discrete Algorithms","article-title":"On the satisfiability and maximum satisfiability of random 3-CNF formulas","author":"Broder","year":"1993"},{"key":"10.1016\/0004-3702(95)00046-1_BIB2","series-title":"Proceedings IJCAI-91","first-page":"163","article-title":"Where the really hard problems are","author":"Cheeseman","year":"1991"},{"issue":"4","key":"10.1016\/0004-3702(95)00046-1_BIB3","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1145\/48014.48016","article-title":"Many hard examples for resolution","volume":"35","author":"Chv\u00e1tal","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(95)00046-1_BIB4","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)00046-1_BIB5","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","article-title":"A machine program for theorem proving","volume":"5","author":"Davis","year":"1962","journal-title":"Commun. ACM"},{"key":"10.1016\/0004-3702(95)00046-1_BIB6","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","article-title":"Linear-time algorithms for testing the satisfiability of propositional Horn formulae","volume":"3","author":"Dowling","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0004-3702(95)00046-1_BIB7","series-title":"Proceedings Second DIMACS Challenge: Cliques, Coloring and Satisfiability","article-title":"SAT versus UNSAT","author":"Dubois","year":"1993"},{"key":"10.1016\/0004-3702(95)00046-1_BIB8","article-title":"Improvements to propositional satisfiability search algorithms","author":"Freeman","year":"1994"},{"key":"10.1016\/0004-3702(95)00046-1_BIB9","author":"Garey","year":"1979"},{"key":"10.1016\/0004-3702(95)00046-1_BIB10","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)00046-1_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)00046-1_BIB12","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)00046-1_BIB13","series-title":"Working Notes AAAI Spring Symposium on AI and NP-Hard Problems","article-title":"Evidence for a satisfiability threshold for random 2CNF formulas","author":"Larrabee","year":"1993"},{"key":"10.1016\/0004-3702(95)00046-1_BIB14","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(95)00046-1_BIB15","article-title":"An empirical study of random SAT","author":"Mitchell","year":"1993"},{"key":"10.1016\/0004-3702(95)00046-1_BIB16","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)00046-1_BIB17","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)00046-1_BIB18","author":"Smullyan","year":"1968"},{"key":"10.1016\/0004-3702(95)00046-1_BIB19","series-title":"Proceedings AAAI-88","first-page":"155","article-title":"A rearrangement search strategy for determining propositional satisfiability","author":"Zabih","year":"1988"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000461?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370295000461?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T21:57:00Z","timestamp":1555538220000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370295000461"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0004370295000461"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(95)00046-1","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}