{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:22Z","timestamp":1725512002038},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540797180"},{"type":"electronic","value":"9783540797197"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-79719-7_5","type":"book-chapter","created":{"date-parts":[[2008,5,6]],"date-time":"2008-05-06T08:04:57Z","timestamp":1210061097000},"page":"34-47","source":"Crossref","is-referenced-by-count":4,"title":["New Results on the Phase Transition for Random Quantified Boolean Formulas"],"prefix":"10.1007","author":[{"given":"Nadia","family":"Creignou","sequence":"first","affiliation":[]},{"given":"Herv\u00e9","family":"Daud\u00e9","sequence":"additional","affiliation":[]},{"given":"Uwe","family":"Egly","sequence":"additional","affiliation":[]},{"given":"Rapha\u00ebl","family":"Rossignol","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"5_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"},{"key":"5_CR2","unstructured":"Chen, H., Interian, Y.: A model for generating random quantified Boolean formulas. In: Proceedings of the 19th International joint Conference on Artificial Intelligence, IJCAI 2005, pp. 66\u201371 (2005)"},{"key":"5_CR3","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":"5_CR4","doi-asserted-by":"crossref","unstructured":"Creignou, N., Daud\u00e9, H., Dubois, O.: Expected number of locally maximal solutions for random Boolean CSPs. In: Proceedings of the13th International Conference on Analysis of Algorithms, AofA 2007, Antibes, June 2007. DMTCS, pp. 507\u2013516 (2007)","DOI":"10.46298\/dmtcs.3539"},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.2120","volume":"19","author":"N. Creignou","year":"2007","unstructured":"Creignou, N., Daud\u00e9, H., Egly, U.: Phase transition for random quantified XOR-formulas. Journal of Artificial Intelligence Research\u00a019, 1\u201318 (2007)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1006\/jagm.1997.0867","volume":"24","author":"O. Dubois","year":"1997","unstructured":"Dubois, O., Boufkhad, Y.: A general upper bound for the satisfiability threshold of random r-SAT formulae. Journal of Algorithms\u00a024(2), 395\u2013420 (1997)","journal-title":"Journal of Algorithms"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/3-540-54487-9_57","volume-title":"Computer Science Logic","author":"A. Fl\u00f6gel","year":"1991","unstructured":"Fl\u00f6gel, A., Karpinski, M., Kleine B\u00fcning, H.: Subclasses of quantified Boolean formulas. In: Sch\u00f6nfeld, W., B\u00f6rger, E., Kleine B\u00fcning, H., Richter, M.M. (eds.) CSL 1990. LNCS, vol.\u00a0533, pp. 145\u2013155. Springer, Heidelberg (1991)"},{"key":"5_CR8","unstructured":"Gent, I.P., Walsh, T.: Beyond NP: the QSAT phase transition. In: Proceedings of AAAI 1999 (1999)"},{"key":"5_CR9","series-title":"Lecture Notes in Artificial Intelligence","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 (LNAI), vol.\u00a02083, pp. 364\u2013369. Springer, Heidelberg (2001)"},{"issue":"3","key":"5_CR10","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":"5_CR11","unstructured":"Interian, Y., Corvera, G., Selman, B., Williams, R.: Finding small unsatisfiable cores to prove unsatisfiability of QBFs. In: Proceedings of the 9th International Symposium on Artificial Intelligence and Mathematics (2006)"},{"key":"5_CR12","doi-asserted-by":"crossref","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."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79719-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T21:47:37Z","timestamp":1631224057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79719-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540797180","9783540797197"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79719-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}