{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T16:15:46Z","timestamp":1649175346864},"reference-count":18,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1051\/ita\/2014025","type":"journal-article","created":{"date-parts":[[2015,2,20]],"date-time":"2015-02-20T09:58:33Z","timestamp":1424426313000},"page":"23-45","source":"Crossref","is-referenced-by-count":0,"title":["Exact location of the phase transition for random (1,2)-QSAT"],"prefix":"10.1051","volume":"49","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":"250","published-online":{"date-parts":[[2015,2,23]]},"reference":[{"key":"R1","unstructured":"Aspvall B., Plass M.F. and Tarjan R.E., A linear-time algorithm for testing the truth of certain quantified boolean formulas.Inform. Process. Lett.8(1979) 121\u2013123."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s B., Borgs C., Chayes J.T., Kim J.H. and Wilson D.B., The scaling window of the 2-SAT transition.Random Structures and Algorithms18(2001) 201\u2013256.","DOI":"10.1002\/rsa.1006"},{"key":"R3","unstructured":"H. Chen and Y. Interian, A model for generating random quantified boolean formulas. InProc. of the 19th International joint Conference on Artificial Intelligence (IJCAI 2005)(2005) 66\u201371."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"V. Chv\u00e1tal and B. Reed, Mick gets some (the odds are on his side). InProc. of the 33rd Annual Symposium on Foundations of Computer Science (FOCS 92)(1992) 620\u2013627.","DOI":"10.1109\/SFCS.1992.267789"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"Creignou N., Daud\u00e9 H. and Egly U., Phase transition for random quantified XOR-formulas.J. Artif. Intell. Res.19(2007) 1\u201318.","DOI":"10.1613\/jair.2120"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"N. Creignou, H. Daud\u00e9, U. Egly and R. Rossignol, New results on the phase transition for random quantified Boolean formulas.Proc. of the 11th International Conference on Theory and Applications of Satisfiability Testing (SAT 2008). In vol. 4996 ofLect. Notes Comput. Sci.(2008) 34\u201347.","DOI":"10.1007\/978-3-540-79719-7_5"},{"key":"R7","unstructured":"N. Creignou, H. Daud\u00e9, U. Egly and R. Rossignol, (1,2)-QSAT: A good candidate for understanding phase transitions mechanisms.Proc. of the 12th International Conference on Theory and Applications of Satisfiability Testing (SAT 2009). In vol. 5584 ofLect. Notes Comput. Sci.(2009) 363\u2013376."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"Fernandez de la Vega W., Random 2-SAT: results and problems.Theor. Comput. Sci.265(2001) 131\u2013146.","DOI":"10.1016\/S0304-3975(01)00156-6"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"Dubois O. and Boufkhad Y., A general upper bound for the satisfiability threshold of randomr-SAT formulae.J. Algorithms24(1997) 395\u2013420.","DOI":"10.1006\/jagm.1997.0867"},{"key":"R10","unstructured":"U. Egly, T. Eiter, H. Tompits and S. Woltran, Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. InProc. of the 17th National Conference on Artificial Intelligence and the 12th Innovative Applications of Artificial Intelligence Conference (AAAI\/IAAI 2000). AAAI Press \/ MIT Press (2000) 417\u2013422."},{"key":"R11","doi-asserted-by":"crossref","unstructured":"A. Fl\u00f6gel, M. Karpinski and H. Kleine B\u00fcning, Subclasses of quantified Boolean formulas. InProceedings of the 4th Workshop on Computer Science Logic (CSL 90)(1990) 145\u2013155.","DOI":"10.1007\/3-540-54487-9_57"},{"key":"R12","unstructured":"I.P. Gent and T. Walsh, Beyond NP: the QSAT phase transition. InProc. of AAAI-99(1999)."},{"key":"R13","doi-asserted-by":"crossref","unstructured":"Goerdt A., A threshold for unsatisfiability.J. Comput. Syst. Sci.53(1996) 469\u2013486.","DOI":"10.1006\/jcss.1996.0081"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"S. Janson, T. Luczack and A. Rucinski, Random graphs. John Wiley (2000).","DOI":"10.1002\/9781118032718"},{"key":"R15","unstructured":"Selman B., Mitchell D. and Levesque H.J., Generating hard satisfiability problems.Artif. Intell.81(1996) 17\u201329."},{"key":"R16","unstructured":"Temme N.M., Asymptotic estimates of Stirling numbers.Stud. Appl. Math.89(1993) 223\u2013243."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"Verhoeven Y., Random 2-SAT and unsatisfiability.Inform. Proc. Lett.72(1999) 119\u2013123.","DOI":"10.1016\/S0020-0190(99)00128-3"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"Wilson D.B., On the critical exponents of randomk-SAT.Random Struct. Algorithms21(2002) 182\u2013195.","DOI":"10.1002\/rsa.10050"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2014025\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T03:30:13Z","timestamp":1566358213000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2014025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":18,"journal-issue":{"issue":"1"},"alternative-id":["ita140028"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2014025","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}