Time—space tradeoffs for satisfiability

Uniform constant-depth threshold circuits for division and iterated multiplication

Journal of Computer and System Sciences - Complexity 2001

Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science

Improved bounds on the weak Pigeonhole principle and infinitely many primes from weaker axioms

Theoretical Computer Science - Mathematical foundations of computer science

On the approximability of clique and related maximization problems

Journal of Computer and System Sciences

Graph properties checkable in linear time in the number of vertices

Journal of Computer and System Sciences

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)

A survey of lower bounds for satisfiability and related problems

Foundations and Trends® in Theoretical Computer Science

Time-Space Tradeoffs for Counting NP Solutions Modulo Integers

Computational Complexity

An Improved Time-Space Lower Bound for Tautologies

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics

Amplifying lower bounds by means of self-reducibility

Journal of the ACM (JACM)

Robust simulations and significant separations

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I

An improved time-space lower bound for tautologies

Journal of Combinatorial Optimization

Time-space lower bounds for the polynomial-time hierarchy on randomized machines

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Proving lower bounds via pseudo-random generators

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science

Determinism versus nondeterminism with arithmetic tests and computation: extended abstract

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing

Hardness of approximation for quantum problems

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I

Lower bounds for RAMs and quantifier elimination

Proceedings of the forty-fifth annual ACM symposium on Theory of computing