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.
Piotr Berman, Marek Karpinski, Alex D. Scott. Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT. Electronic Colloquium on Computational Complexity (ECCC), 10(022), 2003. [doi]
Abstract is missing.