Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms.

Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert

Browse the full CIAC paper archive.