Relativized polynomial time hierarchies having exactly K levels

Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy

Journal of the ACM (JACM)

A Lower Bound For Perceptrons And An Oracle Separation Of The PP/sup PH/ Hierarchy

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity

Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity

Beyond NP: the work and legacy of Larry Stockmeyer

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Hierarchical unambiguity

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

On the power of unambiguity in alternating machines

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory

Collapsing recursive oracles for relativized polynomial hierarchies

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory