{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T22:21:00Z","timestamp":1694557260078},"reference-count":23,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1051\/ita:2003014","type":"journal-article","created":{"date-parts":[[2003,10,9]],"date-time":"2003-10-09T16:34:48Z","timestamp":1065717288000},"page":"127-147","source":"Crossref","is-referenced-by-count":13,"title":["Smooth and sharp thresholds for random{k}<\/i>-XOR-CNF satisfiability"],"prefix":"10.1051","volume":"37","author":[{"given":"Nadia","family":"Creignou","sequence":"first","affiliation":[]},{"given":"Herv\u00e9","family":"Daud\u00e9","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2003,11,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"R. Aharoni and N. Linial, Minimal non 2-colorable hypergraphs and minimal unsatisfiable formulas.J. Combin. Theory Ser. A43(1986).","DOI":"10.1016\/0097-3165(86)90060-9"},{"key":"R2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"Aspvall","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"R3","unstructured":"B. Bollob\u00e1s,Random graphs. Academic Press (1985)."},{"key":"R4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1002\/rsa.3240020103","volume":"2","author":"Chv\u00e1tal","year":"1991","journal-title":"Random Struct. Algorithms"},{"key":"R5","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. IEEE (1992) 620-627.","DOI":"10.1109\/SFCS.1992.267789"},{"key":"R6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0166-218X(99)00032-3","volume":"96-97","author":"Creignou","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"R7","unstructured":"O. Dubois, Y. Boufkhad and J. Mandler, Typical random 3-SAT formulae and the satisfiability threshold, inProc. of the 11th ACM-SIAM Symposium on Discrete Algorithms, SODA'2000 (2000) 124-126."},{"key":"R8","first-page":"17","volume":"7","author":"Erd\u00f6s","year":"1960","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"R9","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1090\/S0894-0347-99-00305-7","volume":"12","author":"Friedgut","year":"1999","journal-title":"J. Amer. Math. Soc."},{"key":"R10","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1006\/jagm.1996.0016","volume":"20","author":"Frieze","year":"1996","journal-title":"J. Algorithms"},{"key":"R11","unstructured":"I.P. Gent and T. Walsh, The SAT phase transition, inProc. of the 11th European Conference on Artificial Intelligence(1994) 105-109."},{"key":"R12","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1006\/jcss.1996.0081","volume":"53","author":"Goerdt","year":"1996","journal-title":"J. Comput. System Sci."},{"key":"R13","unstructured":"G. Grimmet,Percolation. Springer Verlag (1989)."},{"key":"R14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-4149(87)90048-2","volume":"26","author":"Janson","year":"1987","journal-title":"Stochastic Process. Appl."},{"key":"R15","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1126\/science.264.5163.1297","volume":"264","author":"Kirkpatrick","year":"1994","journal-title":"Science"},{"key":"R16","first-page":"425","volume":"5","author":"Kolchin","year":"1995","journal-title":"Random Struct. Algorithms"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"V.F. Kolchin,Random graphs. Cambridge University Press (1999).","DOI":"10.1017\/CBO9780511721342"},{"key":"R18","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1515\/dma.1992.2.1.109","volume":"2","author":"Kolchin","year":"1992","journal-title":"Discrete Math. Appl."},{"key":"R19","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1137\/1112005","volume":"12","author":"Kovalenko","year":"1967","journal-title":"Theory Probab. Appl."},{"key":"R20","unstructured":"D. Mitchell, B. Selman and H. Levesque, Hard and easy distributions of SAT problems, inProc. of the 10th National Conference on Artificial Intelligence(1992) 459-465."},{"key":"R21","doi-asserted-by":"crossref","first-page":"1357","DOI":"10.1103\/PhysRevE.56.1357","volume":"56","author":"Monasson","year":"1997","journal-title":"Phys. Rev. E"},{"key":"R22","doi-asserted-by":"crossref","unstructured":"T.J. Schaefer, The complexity of satisfiability problems, inProceedings 10th STOC, San Diego (CA, USA). Association for Computing Machinery (1978) 216-226.","DOI":"10.1145\/800133.804350"},{"key":"R23","doi-asserted-by":"crossref","first-page":"359","DOI":"10.2307\/3214169","volume":"25","author":"Tak\u00e1cs","year":"1988","journal-title":"J. Appl. Probab."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2003014\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T23:53:40Z","timestamp":1585180420000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2003014"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":23,"journal-issue":{"issue":"2"},"alternative-id":["ita0306"],"URL":"http:\/\/dx.doi.org\/10.1051\/ita:2003014","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}
