Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert. Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. In Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano, editors, Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings. Volume 3998 of Lecture Notes in Computer Science, pages 60-68, Springer, 2006. [doi]
Abstract is missing.