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

Evgeny Dantsin Edward A. Hirsch Alexander Wolpert Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. 60-68 2006 conf/ciac/2006 CIAC http://dx.doi.org/10.1007/11758471_9 db/conf/ciac/ciac2006.html#DantsinHW06