Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
Journal of the ACM (JACM)
With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A depth-size and tradeoff for Boolean circuits with unbounded fan-in
Proc. of the conference on Structure in complexity theory
Computational limitations of small-depth circuits
Computational limitations of small-depth circuits
Optimal bounds for decision problems on the CRCW PRAM
Journal of the ACM (JACM)
Lower bounds for recognizing small cliques on CRCW PRAM'S
Discrete Applied Mathematics
Approximation and small-depth Frege proofs
SIAM Journal on Computing
The independence of the modulo p counting principles
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Modular coloring formulas are hard for cutting planes proofs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Monotone Proofs of the Pigeon Hole Principle
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Lower bounds for the weak Pigeonhole principle and random formulas beyond resolution
Information and Computation
Two party immediate response disputes: properties and efficiency
Artificial Intelligence
Circuit principles and weak pigeonhole variants
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Circuit principles and weak pigeonhole variants
Theoretical Computer Science
Note: On the Chvátal rank of the Pigeonhole Principle
Theoretical Computer Science
ACM Transactions on Computation Theory (TOCT)
The complexity of the Hajós calculus for planar graphs
Theoretical Computer Science
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Exponential lower bounds for AC0-Frege imply superpolynomial frege lower bounds
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On the complexity of the sperner lemma
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Proof complexity of non-classical logics
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Proof complexity of non-classical logics
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
| Hi-index | 0.00 |