Probabilistic quantifiers, adversaries, and complexity classes: an overview
Proc. of the conference on Structure in complexity theory
The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Randomness, provability, and the separation of Monte Carlo time and space
Computation theory and logic
Two-Tape Simulation of Multitape Turing Machines
Journal of the ACM (JACM)
Separating Nondeterministic Time Complexity Classes
Journal of the ACM (JACM)
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
ACM SIGACT News
Retraction of probabilistic computation and linear time
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Hardness and hierarchy theorems for probabilistic quasi-polynomial time
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
A Generic Time Hierarchy with One Bit of Advice
Computational Complexity
| Hi-index | 0.00 |
In this paper, we give an oracle under which BPP is equal to probabilistic linear time, an unusual collapse of a complexity time hierarchy. In addition, we also give oracles where &Dgr;P2 is contained in probabilistic linear time and where BPP has linear sized circuits, as well as oracles for the negation of these questions. This indicates that these questions will not be solved by techniques that relativize. Finally, we note that probabilistic linear time can not contain both NP and BPP, implying that there are languages solvable by interactive proof systems that can not be solved in probabilistic linear time.