Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
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
With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Journal of Computer and System Sciences
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Relativized collapsing between BPP and PH under stringent oracle access
Information Processing Letters
| Hi-index | 0.00 |
A way-cool new project and web site has been created by Greg Kuperberg. Greg is trying to graphically capture the known (for now, relativizable) relationships between classes, and to make clear to everyone what open questions remain. The starting point for Greg's "Complexity Zoology" site is www.math.ucdavis.edu/~greg/zoology/. Greg welcomes feedback, corrections, and (best of all) new or missed results.