{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:11Z","timestamp":1720640831089},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"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":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s1571-0653(04)00459-7","type":"journal-article","created":{"date-parts":[[2004,10,24]],"date-time":"2004-10-24T03:07:12Z","timestamp":1098587232000},"page":"1-14","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["SAT Distributions with Phase Transitions between Decision and Optimization Problems"],"prefix":"10.1016","volume":"16","author":[{"given":"Tassos","family":"Dimitriou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00459-7_NEWBIB1","series-title":"The Probabilistic method","author":"Alon","year":"2000"},{"issue":"3","key":"10.1016\/S1571-0653(04)00459-7_NEWBIB2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","article-title":"A linear-time algorithm for testing the truth of certain quantified boolean formulas","volume":"8","author":"Aspvall","year":"1979","journal-title":"Information Processing Letters"},{"key":"10.1016\/S1571-0653(04)00459-7_NEWBIB3","unstructured":"P. Cheeseman, B. Kanefsky, and W. M. Taylor. Where the really hard problems are. In Proceedings IJCAI-91, pages 331\u2013337, Sydney, Australia, 1991."},{"key":"10.1016\/S1571-0653(04)00459-7_NEWBIB4","unstructured":"J. Crawford and L. D. Auton. Experimental results on the cross over point in satisfiability problems. In Proc. AAAI-93, pp. 21\u201327, 1993"},{"key":"10.1016\/S1571-0653(04)00459-7_NEWBIB5","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erd\u00f6s","year":"1960","journal-title":"Mat Kutato Int. Kozl"},{"key":"10.1016\/S1571-0653(04)00459-7_NEWBIB6","unstructured":"I. Gent and T. Walsh. The SAT Phase Transition. In Proc. ECAI-94, 105\u2013109."},{"key":"10.1016\/S1571-0653(04)00459-7_NEWBIB7","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/S0004-3702(96)00030-6","article-title":"The TSP Phase Transition","volume":"88","author":"Gent","year":"1996","journal-title":"Artif. Intel"},{"key":"10.1016\/S1571-0653(04)00459-7_NEWBIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(95)00044-5","article-title":"Phase transitions and the search problem","volume":"81","author":"Hogg","year":"1996","journal-title":"Artif. Intell"},{"key":"10.1016\/S1571-0653(04)00459-7_NEWBIB9","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\/S1571-0653(04)00459-7_NEWBIB10","series-title":"A previous version appeared in Proc. AAAI-92 Vol. 81 (1\u20132)","first-page":"459","article-title":"Generating hard satisfiability problems. Artificial Intelligence","author":"Mitchell","year":"1996"},{"issue":"8","key":"10.1016\/S1571-0653(04)00459-7_NEWBIB11","article-title":"Determining computational complexity from characteristic \u2018phase transitions\u2019","volume":"Vol. 400","author":"Monasson","year":"1999","journal-title":"Nature"},{"key":"10.1016\/S1571-0653(04)00459-7_NEWBIB12","unstructured":"B. Selman, H. A. Kautz and B. Cohen. Local search strategies for satisfiability testing. In Second DIMACS Challenge on Cliques, Coloring and Satisfiability, 1993."},{"key":"10.1016\/S1571-0653(04)00459-7_NEWBIB13","unstructured":"J. Slaney and T. Walsh. Backbones in Optimization and Approximation. In Proc. IJCAI-01, 2001."},{"key":"10.1016\/S1571-0653(04)00459-7_NEWBIB14","doi-asserted-by":"crossref","unstructured":"W. Zhang. Phase transitions and backbones of 3-SAT and MAX 3-SAT. In Proc. CP-2001.","DOI":"10.1007\/3-540-45578-7_11"},{"key":"10.1016\/S1571-0653(04)00459-7_NEWBIB15","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0004-3702(95)00054-2","article-title":"A study of complexity transitions on the asymmetric Travelling Salesman Problem","volume":"81","author":"Zhang","year":"1996","journal-title":"Artificial Intelligence"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004597?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004597?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T12:50:42Z","timestamp":1585918242000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304004597"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":15,"alternative-id":["S1571065304004597"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00459-7","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}