An O(T log T) reduction from RAM computations to satisfiability

Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity

A survey of lower bounds for satisfiability and related problems

Foundations and Trends® in Theoretical Computer Science

Guest column: a casual tour around a circuit complexity bound

ACM SIGACT News

Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract

Proceedings of the 4th conference on Innovations in Theoretical Computer Science

Nonuniform ACC Circuit Lower Bounds

Journal of the ACM (JACM)