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.
Ruiwen Chen. Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases. Electronic Colloquium on Computational Complexity (ECCC), 22:99, 2015. [doi]