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 Electronic Colloquium on Computational Complexity (ECCC) 2005 102 db/journals/eccc/eccc12.html#TR05-102 http://eccc.hpi-web.de/eccc-reports/2005/TR05-102/index.html