{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T05:25:01Z","timestamp":1740029101107,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121999"},{"type":"electronic","value":"9783642122002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12200-2_29","type":"book-chapter","created":{"date-parts":[[2010,4,21]],"date-time":"2010-04-21T13:53:05Z","timestamp":1271857985000},"page":"320-331","source":"Crossref","is-referenced-by-count":0,"title":["Limit Theorems for Random MAX-2-XORSAT"],"prefix":"10.1007","author":[{"given":"Vonjy","family":"Rasendrahasina","sequence":"first","affiliation":[]},{"given":"Vlady","family":"Ravelomanana","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"29_CR1","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1137\/S0097539703434231","volume":"36","author":"D. Achlioptas","year":"2006","unstructured":"Achlioptas, D., Moore, C.: Random k-SAT: Two moments suffice to cross a sharp threshold. SIAM Journal of Computing\u00a036(3), 740\u2013762 (2006)","journal-title":"SIAM Journal of Computing"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Achlioptas, D., Naor, A., Peres, Y.: On the maximum satisfiability of random formulas. Journal of the ACM\u00a054(2) (2007)","DOI":"10.1145\/1219092.1219098"},{"key":"29_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107325913","volume-title":"Combinatorial Species and Tree-like Structures","author":"F. Bergeron","year":"1997","unstructured":"Bergeron, F., Labelle, G., Leroux, P.: Combinatorial Species and Tree-like Structures. Cambridge University Press, Cambridge (1997)"},{"key":"29_CR4","unstructured":"Bollob\u00e1s, B.: Random Graphs. Cambridge Studies in Advanced Mathematics (1985)"},{"key":"29_CR5","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, 201\u2013256 (2001)","journal-title":"Random Structures and Algorithms"},{"issue":"4","key":"29_CR6","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1002\/rsa.20015","volume":"24","author":"D. Coppersmith","year":"2004","unstructured":"Coppersmith, D., Hajiaghayi, M.T., Gamarnik, D., Sorkin, G.B.: Random MAX-SAT, random MAX-CUT, and their phase transitions. Random Structures and Algorithms\u00a024(4), 502\u2013545 (2004)","journal-title":"Random Structures and Algorithms"},{"issue":"1-3","key":"29_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0166-218X(99)00032-3","volume":"96-97","author":"N. Creignou","year":"1999","unstructured":"Creignou, N., Daud\u00e9, H.: Satisfiability threshold for random XOR-CNF formula. Discrete Applied Mathematics\u00a096-97(1-3), 41\u201353 (1999)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"29_CR8","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1051\/ita:2003014","volume":"37","author":"N. Creignou","year":"2003","unstructured":"Creignou, N., Daud\u00e9, H.: Coarse and sharp thresholds for random k-XOR-CNF satisfiability. Theoretical Informatics and Applications\u00a037(2), 127\u2013147 (2003)","journal-title":"Theoretical Informatics and Applications"},{"key":"29_CR9","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/978-3-0348-7915-6_49","volume-title":"Proc. of the third Colloquium on Mathematics and Computer Science","author":"N. Creignou","year":"2004","unstructured":"Creignou, N., Daud\u00e9, H.: Coarse and sharp transitions for random generalized satisfiability problems. In: Proc. of the third Colloquium on Mathematics and Computer Science, pp. 507\u2013516. Birkh\u00e4user, Basel (2004)"},{"key":"#cr-split#-29_CR10.1","unstructured":"Daud\u00e9, H., Ravelomanana, V.: Random 2-XORSAT phase transition. Algorithmica (2009); In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 12\u201323. Springer, Heidelberg (2008)"},{"key":"#cr-split#-29_CR10.2","unstructured":"In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.??4957, pp. 12???23. Springer, Heidelberg (2008)"},{"key":"29_CR11","volume-title":"Asymptotic Methods in Analysis","author":"N.G. Bruin de","year":"1981","unstructured":"de Bruin, N.G.: Asymptotic Methods in Analysis. Dover, New York (1981)"},{"issue":"4","key":"29_CR12","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1002\/rsa.3240070405","volume":"7","author":"J. DeLaurentis","year":"1995","unstructured":"DeLaurentis, J.: Appearance of complex components in a random bigraph. Random Structures and Algorithms\u00a07(4), 311\u2013335 (1995)","journal-title":"Random Structures and Algorithms"},{"key":"29_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/b100033","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory. Springer, Heidelberg (2000)"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Dubois, O., Mandler, J.: The 3-XOR-SAT threshold. In: Proceedings of the 43th Annual IEEE Symposium on Foundations of Computer Science, pp. 769\u2013778 (2002)","DOI":"10.1109\/SFCS.2002.1182002"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Dubois, O., Monasson, R., Selman, B., Zecchina, R.: Phase transitions in combinatorial problems. Theoretical Computer Science\u00a0265(1-2) (2001)","DOI":"10.1016\/S0304-3975(01)00133-5"},{"issue":"1-3","key":"29_CR16","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0012-365X(89)90087-3","volume":"75","author":"P. Flajolet","year":"1989","unstructured":"Flajolet, P., Knuth, D.E., Pittel, B.: The first cycles in an evolving graph. Discrete Mathematics\u00a075(1-3), 167\u2013215 (1989)","journal-title":"Discrete Mathematics"},{"key":"29_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511801655","volume-title":"Analytic Combinatorics","author":"P. Flajolet","year":"2009","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)"},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1023\/A:1022885828956","volume":"111","author":"S. Franz","year":"2003","unstructured":"Franz, S., Leone, M.: Replica bounds for optimization problems and diluted spin systems. Journal of Statistical Physics\u00a0111, 535\u2013564 (2003)","journal-title":"Journal of Statistical Physics"},{"issue":"4","key":"29_CR19","first-page":"1017","volume":"12","author":"E. Friedgut","year":"1999","unstructured":"Friedgut, E.: Sharp thresholds of graph properties, and the k-SAT problem. appendix by J. Bourgain. Journal of the A.M.S.\u00a012(4), 1017\u20131054 (1999)","journal-title":"Journal of the A.M.S."},{"issue":"3","key":"29_CR20","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1006\/jcss.1996.0081","volume":"53","author":"A. Goerdt","year":"1996","unstructured":"Goerdt, A.: A sharp threshold for unsatisfiability. Journal of Computer and System Sciences\u00a053(3), 469\u2013486 (1996)","journal-title":"Journal of Computer and System Sciences"},{"key":"29_CR21","volume-title":"Combinatorial enumeration","author":"I.P. Goulden","year":"1983","unstructured":"Goulden, I.P., Jackson, D.M.: Combinatorial enumeration. John Wiley and Sons, Chichester (1983)"},{"key":"29_CR22","volume-title":"Graphical enumeration","author":"F. Harary","year":"1973","unstructured":"Harary, F., Palmer, E.: Graphical enumeration. Academic Press, New-York (1973)"},{"key":"29_CR23","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1073\/pnas.39.4.315","volume":"39","author":"F. Harary","year":"1953","unstructured":"Harary, F., Uhlenbeck, G.: On the number of Husimi trees, I. Proceedings of the National Academy of Sciences\u00a039, 315\u2013322 (1953)","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"3","key":"29_CR24","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1002\/rsa.3240040303","volume":"4","author":"S. Janson","year":"1993","unstructured":"Janson, S., Knuth, D.E., \u0141uczak, T., Pittel, B.: The birth of the giant component. Random Structures and Algorithms\u00a04(3), 233\u2013358 (1993)","journal-title":"Random Structures and Algorithms"},{"key":"29_CR25","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S. Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random Graphs. Wiley-Interscience, Hoboken (2000)"},{"key":"29_CR26","volume-title":"Random graphs","author":"V.F. Kolchin","year":"1999","unstructured":"Kolchin, V.F.: Random graphs. Cambridge University Press, Cambridge (1999)"},{"issue":"2","key":"29_CR27","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.jctb.2004.09.005","volume":"93","author":"B. Pittel","year":"2005","unstructured":"Pittel, B., Wormald, N.C.: Counting connected graphs inside-out. Journal of Comb. Theory, Ser. B\u00a093(2), 127\u2013172 (2005)","journal-title":"Journal of Comb. Theory, Ser. B"},{"issue":"1","key":"29_CR28","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ipl.2007.05.003","volume":"104","author":"V. Ravelomanana","year":"2007","unstructured":"Ravelomanana, V.: Another proof of Wright\u2019s inequalities. Information Processing Letters\u00a0104(1), 36\u201339 (2007)","journal-title":"Information Processing Letters"},{"key":"29_CR29","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1002\/jgt.3190010407","volume":"1","author":"E.M. Wright","year":"1977","unstructured":"Wright, E.M.: The number of connected sparsely edged graphs. Journal of Graph Theory\u00a01, 317\u2013330 (1977)","journal-title":"Journal of Graph Theory"},{"issue":"4","key":"29_CR30","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/jgt.3190040409","volume":"4","author":"E.M. Wright","year":"1980","unstructured":"Wright, E.M.: The number of connected sparsely edged graphs III: Asymptotic results. Journal of Graph Theory\u00a04(4), 393\u2013407 (1980)","journal-title":"Journal of Graph Theory"}],"container-title":["Lecture Notes in Computer Science","LATIN 2010: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12200-2_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T03:13:05Z","timestamp":1740021185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12200-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121999","9783642122002"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12200-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}