{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T14:01:47Z","timestamp":1777125707176,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540208518","type":"print"},{"value":"9783540246053","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24605-3_36","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T04:50:35Z","timestamp":1280379035000},"page":"486-501","source":"Crossref","is-referenced-by-count":12,"title":["kcnfs: An Efficient Solver for Random k-SAT Formulae"],"prefix":"10.1007","author":[{"given":"Gilles","family":"Dequen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Dubois","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","unstructured":"Dubois, O., Dequen, G.: A Backbone Search Heuristic for Efficient Solving of Hard 3-SAT Formulae. In: Proc. of the 17th Internat. Joint Conf. on Artificial Intelligence, Seattle, 248\u2013253 (2001)"},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1038\/22055","volume":"400","author":"R. Monasson","year":"1999","unstructured":"Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Troyansky, L.: Determining Computational Complexity from Characteristic \u2018Phase Transitions\u2019. Nature\u00a0400, 133\u2013137 (1999)","journal-title":"Nature"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. Journal Association for Computing Machine, 201\u2013215 (1960)","DOI":"10.1145\/321033.321034"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Davis, M., Logemann, G., Loveland, D.: A Machine Program for Theorem- Proving. Journal Association for Computing Machine, 394\u2013397 (1962)","DOI":"10.1145\/368273.368557"},{"key":"36_CR5","unstructured":"Li, C.M., Anbulagan: Heuristics Based on Unit Propagation for Satisfiability Problems. In: Proc. of the 15th Internat. Joint Conf. on Artificial Intelligence, Nagoya (Japan), IJCAI, 366\u2013371 (1997)"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0004-3702(95)00051-8","volume":"81","author":"J.W. Freeman","year":"1996","unstructured":"Freeman, J.W.: Hard Random 3-SAT Problems and the Davis-Putnam Procedure. Artificial Intelligence\u00a081, 183\u2013198 (1996)","journal-title":"Artificial Intelligence"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Dubois, O., Andre, P., Boufkhad, Y., Carlier, J.: SAT versus UNSAT. DIMACS Series in Discr. Math. and Theor. Computer Science, pp. 415\u2013436 (1993)","DOI":"10.1090\/dimacs\/026\/20"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0020-0190(99)00088-5","volume":"71","author":"C.M. Li","year":"1999","unstructured":"Li, C.M.: A Constraint-Based Approach to Narrow Search Trees for Satisfiability. Information Processing Letters\u00a071, 75\u201380 (1999)","journal-title":"Information Processing Letters"},{"key":"36_CR9","unstructured":"Kullman, O.: Heuristics for SAT algorithms: A systematic study. In: Extended abstract for the Second workshop on the satisfiability problem, SAT 1998 (1998)"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proceedings of the 38th Design Automation Conference, DAC 2001 (2001)","DOI":"10.1145\/378239.379017"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1007\/3-540-63104-6_28","volume-title":"Automated Deduction - CADE-14","author":"H. Zhang","year":"1997","unstructured":"Zhang, H.: SATO. An Efficient Propositional Prover. In: McCune, W. (ed.) CADE 1997. LNCS, vol.\u00a01249, pp. 272\u2013275. Springer, Heidelberg (1997)"},{"key":"36_CR12","first-page":"337","volume-title":"Proc. of the 12th National Conf. on Artificial Intelligence","author":"B. Selman","year":"1994","unstructured":"Selman, B., Kautz, H.A., Cohen, B.: Noise Strategies for Improving Local Search. In: Proc. of the 12th National Conf. on Artificial Intelligence, Menlo Park, CA, USA, vol.\u00a01, pp. 337\u2013343. AAAI Press, Menlo Park (1994)"},{"key":"36_CR13","unstructured":"Braunstein, A., Mezard, M., Zecchina. R.: Survey propagation: an algorithm for satisfiability. arXiv - cond-mat\/0207194 (2002)"},{"key":"36_CR14","unstructured":"Li, C.M., Gerard, S.: On the Limit of Branching Rules for Hard Random Unsatisfiable 3-SAT. In: Proc. of European Conf. on Artificial Intelligence, ECAI, pp. 98\u2013102 (2000)"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Biroli, G., Monasson, R., Weigt, M.: A variational description of the ground state structure in random satisfiability problems. Eur. Phys. J. B 14 551 (2000)","DOI":"10.1007\/s100510051065"},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"Mezard, M., Parisi, G., Zecchina, R.: Analytic and algorithmic solutions of random satisfiability problems. Science\u00a0297 (2002)","DOI":"10.1126\/science.1073287"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24605-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T19:54:06Z","timestamp":1559332446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24605-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540208518","9783540246053"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24605-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}