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.
Rahul Santhanam. Ironic Complicity: Satisfiability Algorithms and Circuit Lower Bounds. Bulletin of the EATCS, 106:31-52, 2012. [doi]
No references recorded for this publication.
No citations of this publication recorded.