{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T21:07:30Z","timestamp":1758402450585},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141850"},{"type":"electronic","value":"9783642141867"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-14186-7_22","type":"book-chapter","created":{"date-parts":[[2010,7,8]],"date-time":"2010-07-08T18:20:37Z","timestamp":1278613237000},"page":"264-277","source":"Crossref","is-referenced-by-count":11,"title":["Bounds on Threshold of Regular Random k-SAT"],"prefix":"10.1007","author":[{"given":"Vishwambhar","family":"Rathi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik","family":"Aurell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Rasmussen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikael","family":"Skoglund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_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 J. COMPUT.\u00a036, 740\u2013762 (2006)","journal-title":"SIAM J. COMPUT."},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Achlioptas, D., Naor, A., Peres, Y.: On the maximum satisfiability of random formulas. Journal of the Association of Computing Machinary (JACM)\u00a054 (2007)","DOI":"10.1145\/1219092.1219098"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1090\/S0894-0347-04-00464-3","volume":"17","author":"D. AChlioptas","year":"2004","unstructured":"AChlioptas, D., Peres, Y.: The threshold for random k-SAT is 2 k ln (2)\u2009\u2212\u2009O(k). Journal of the American Mathematical Society\u00a017, 947\u2013973 (2004)","journal-title":"Journal of the American Mathematical Society"},{"key":"22_CR4","unstructured":"Barak, O., Burshtein, D.: Lower bounds on the spectrum and error rate of LDPC code ensembles. In: International Symposium on Information Theory, Adelaide, Australia (2002)"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0097-3165(83)90062-6","volume":"34","author":"E.A. Bender","year":"1983","unstructured":"Bender, E.A., Richmond, L.B.: Central and local limit theorems applied to asymptotic enumeration II: Multivariate generating functions. J. Combin. Theory, Ser. A\u00a034, 255\u2013265 (1983)","journal-title":"J. Combin. Theory, Ser. A"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Boufkhad, Y., Dubois, O., Interian, Y., Selman, B.: Regular random k-SAT: Properties of balanced formulas. Journal of Automated Reasoning (2005)","DOI":"10.1007\/s10817-005-9012-z"},{"key":"22_CR7","volume-title":"Asymptotic Methods in Analysis","author":"N.G.D. Bruijn","year":"1981","unstructured":"Bruijn, N.G.D.: Asymptotic Methods in Analysis. North Holland, Amsterdam (1981)"},{"key":"22_CR8","doi-asserted-by":"publisher","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":"22_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0166-218X(83)90017-3","volume":"5","author":"J. Franco","year":"1983","unstructured":"Franco, J., Paull, M.: Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem. Discrete Appl. Math.\u00a05, 77\u201387 (1983)","journal-title":"Discrete Appl. Math."},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1090\/S0894-0347-04-00464-3","volume":"17","author":"E. Friedgut","year":"2004","unstructured":"Friedgut, E.: Sharp threshold for graph properties, and the k-SAT problem. Journal of the American Mathematical Society\u00a017, 947\u2013973 (2004)","journal-title":"Journal of the American Mathematical Society"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0012-365X(94)00133-4","volume":"139","author":"D. Gardy","year":"1995","unstructured":"Gardy, D.: Some results on the asymptotic behavior of coefficients of large powers of functions. Discrete Mathematics\u00a0139, 189\u2013217 (1995)","journal-title":"Discrete Mathematics"},{"key":"22_CR12","volume-title":"Applied and Computation Complex Analysis","author":"P. Henrici","year":"1974","unstructured":"Henrici, P.: Applied and Computation Complex Analysis, vol.\u00a02. John Wiley, Chichester (1974)"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Kaporis, A.C., Kirousis, L.M., Lalas, E.G.: The probabilistic analysis of a greedy satisfying algorithm. In: 10th Annual European Symposium on Algorithms, vol. Ser. A 34 (2002)","DOI":"10.1007\/3-540-45749-6_51"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"4212","DOI":"10.1109\/TIT.2006.880065","volume":"52","author":"V. Rathi","year":"2006","unstructured":"Rathi, V.: On the asymptotic weight and stopping set distributions of regular LDPC ensembles. IEEE Trans. Inform. Theory\u00a052, 4212\u20134218 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"22_CR15","unstructured":"Rathi, V.: Non-binary LDPC codes and EXIT like functions, PhD thesis, Swiss Federal Institute of Technology (EPFL), Lausanne (2008)"},{"key":"22_CR16","unstructured":"Rathi, V., Aurell, E., Rasmussen, L., Skoglund, M.: Bounds on maximum satisfiability threshold of regular random k-SAT. arXiv:1004.2425 (submitted)"},{"key":"22_CR17","unstructured":"Rathi, V., Aurell, E., Rasmussen, L., Skoglund, M.: Satisfiability and maximum satisfiability of regular random k-sat: Bounds on thresholds (in preparation for journal submission)"},{"key":"22_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338","volume-title":"Modern Coding Theory","author":"T. Richardson","year":"2008","unstructured":"Richardson, T., Urbanke, R.: Modern Coding Theory. Cambridge University Press, Cambridge (2008)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14186-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:31:34Z","timestamp":1559241094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14186-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141850","9783642141867"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14186-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}