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]
Abstract is missing.