{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:18:12Z","timestamp":1742919492340,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027765"},{"type":"electronic","value":"9783642027772"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02777-2_34","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T02:58:18Z","timestamp":1245985098000},"page":"363-376","source":"Crossref","is-referenced-by-count":1,"title":["(1,2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms"],"prefix":"10.1007","author":[{"given":"Nadia","family":"Creignou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herv\u00e9","family":"Daud\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uwe","family":"Egly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rapha\u00ebl","family":"Rossignol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"34_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B. Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Information Processing Letters\u00a08(3), 121\u2013123 (1979)","journal-title":"Information Processing Letters"},{"issue":"3","key":"34_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/rsa.1006","volume":"18","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B., Borgs, C., Chayes, J.T., Kim, J.H., Wilson, D.B.: The scaling window of the 2-SAT transition. Random Structures and Algorithms\u00a018(3), 201\u2013256 (2001)","journal-title":"Random Structures and Algorithms"},{"key":"34_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-540-79719-7_5","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"N. Creignou","year":"2008","unstructured":"Creignou, N., Daud\u00e9, H., Egly, U., Rossignol, R.: New results on the phase transition for random quantified Boolean formulas. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol.\u00a04996, pp. 34\u201347. Springer, Heidelberg (2008)"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Chv\u00e1tal, V., Reed, B.: Mick gets some (the odds are on his side). In: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (FOCS 1992), pp. 620\u2013627 (1992)","DOI":"10.1109\/SFCS.1992.267789"},{"key":"34_CR5","unstructured":"de la Fernandez Vega, W.: On random 2-SAT (manuscript, 1992)"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1140\/epjb\/e2006-00072-6","volume":"49","author":"C. Deroulers","year":"2006","unstructured":"Deroulers, C., Monasson, R.: Criticality and universality in the unit-propagation search rule. Eur. Phys. J. B\u00a049, 339\u2013369 (2006)","journal-title":"Eur. Phys. J. B"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Fl\u00f6gel, A., Karpinski, M., Kleine B\u00fcning, H.: Subclasses of quantified Boolean formulas. In: Proceedings of the 4th Workshop on Computer Science Logic (CSL 1990), pp. 145\u2013155 (1990)","DOI":"10.1007\/3-540-54487-9_57"},{"key":"34_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-45744-5_27","volume-title":"Automated Reasoning","author":"E. Giunchiglia","year":"2001","unstructured":"Giunchiglia, E., Narizzano, M., Tacchella, A.: QuBE: A system for deciding quantified Boolean formulas satisfiability. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS, vol.\u00a02083, pp. 364\u2013369. Springer, Heidelberg (2001)"},{"issue":"3","key":"34_CR9","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1006\/jcss.1996.0081","volume":"53","author":"A. Goerdt","year":"1996","unstructured":"Goerdt, A.: A threshold for unsatisfiability. Journal of of Computer and System Sciences\u00a053(3), 469\u2013486 (1996)","journal-title":"Journal of of Computer and System Sciences"},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc.\u00a058, 13\u201330 (1963)","journal-title":"J. Amer. Statist. Assoc."},{"key":"34_CR11","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718","volume-title":"Random graphs","author":"S. Janson","year":"2000","unstructured":"Janson, S., Luczack, T., Rucinski, A.: Random graphs. John Wiley, New York (2000)"},{"issue":"1-2","key":"34_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0004-3702(95)00045-3","volume":"81","author":"B. Selman","year":"1996","unstructured":"Selman, B., Mitchell, D., Levesque, H.J.: Generating hard satisfiability problems. Artificial Intelligence\u00a081(1-2), 17\u201329 (1996)","journal-title":"Artificial Intelligence"},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/sapm1993893233","volume":"89","author":"N.M. Temme","year":"1993","unstructured":"Temme, N.M.: Asymptotic estimates of Stirling numbers. Stud. appl. Math.\u00a089, 223\u2013243 (1993)","journal-title":"Stud. appl. Math."},{"issue":"2","key":"34_CR14","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1002\/rsa.10050","volume":"21","author":"D.B. Wilson","year":"2002","unstructured":"Wilson, D.B.: On the critical exponents of random k-SAT. Random Structures and Algorithms\u00a021(2), 182\u2013195 (2002)","journal-title":"Random Structures and Algorithms"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2009"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02777-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:05:51Z","timestamp":1558267551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02777-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027765","9783642027772"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02777-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}