kcnfs: An Efficient Solver for Random k-SAT Formulae

Gilles Dequen, Olivier Dubois. kcnfs: An Efficient Solver for Random k-SAT Formulae. In Enrico Giunchiglia, Armando Tacchella, editors, Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003 Selected Revised Papers. Volume 2919 of Lecture Notes in Computer Science, pages 486-501, Springer, 2003. [doi]

Abstract

Abstract is missing.