Deterministic versus nondeterministic time and lower bound problems
Journal of the ACM (JACM)
Small PCPs with Low Query Complexity
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Time-space lower bounds for satisfiability
Journal of the ACM (JACM)
A time lower bound for satisfiability
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Inductive Time-Space Lower Bounds for Sat and Related Problems
Computational Complexity
A survey of lower bounds for satisfiability and related problems
Foundations and Trends® in Theoretical Computer Science
ACM SIGACT News
Amplifying lower bounds by means of self-reducibility
Journal of the ACM (JACM)
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Robust simulations and significant separations
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Guest column: a casual tour around a circuit complexity bound
ACM SIGACT News
Alternation-Trading Proofs, Linear Programming, and Lower Bounds
ACM Transactions on Computation Theory (TOCT)
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
| Hi-index | 0.90 |