Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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), (102), 2005. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT AlgorithmsEvgeny Dantsin, Edward A. Hirsch, Alexander Wolpert. ciac 2006: 60-68 [doi] An Improved Upper Bound for SATEvgeny Dantsin, Alexander Wolpert. sat 2005: 400-407 [doi] A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause LengthEvgeny Dantsin, Alexander Wolpert. jsat, 1(1):49-60, 2006. [doi]
The following publications are possibly variants of this publication: