Relativized polynomial time hierarchies having exactly K levels

Authors:
Ker-I Ko
Affiliations:
Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY
Venue:
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Year:
1988

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
Computational limitations of small-depth circuits

Computational limitations of small-depth circuits
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Borel sets and circuit complexity

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Hi-index	0.00