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.
Ryan Williams. Better Time-Space Lower Bounds for SAT and Related Problems. In 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA. pages 40-49, IEEE Computer Society, 2005. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Inductive Time-Space Lower Bounds for Sat and Related ProblemsRyan Williams. cc, 15(4):433-470, 2006. [doi] Connecting SAT Algorithms and Complexity Lower BoundsRyan Williams. sat 2011: 1-2 [doi]
The following publications are possibly variants of this publication: