Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
Journal of the ACM (JACM)
Almost optimal lower bounds for small depth circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy
Journal of the ACM (JACM)
Exponential lower bounds for the pigeonhole principle
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The random oracle hypothesis is false
Journal of Computer and System Sciences
Relativized collapsing between BPP and PH under stringent oracle access
Information Processing Letters
Approximate recognition of non-regular languages by finite automata
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
On Approximating Non-regular Languages by Regular Languages
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
| Hi-index | 0.00 |