Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case

Authors:
Robert Rettinger;Rutger Verbeek
Affiliations:
-;-
Venue:
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Year:
2001

Citing 8
Cited 0

Randomness, provability, and the separation of Monte Carlo time and space

Computation theory and logic
On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes

Information and Computation
Probabilistic computation and linear time

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Structural complexity 2

Structural complexity 2
Almost-everywhere complexity hierarchies for nondeterministic time

Theoretical Computer Science
Retraction of probabilistic computation and linear time

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Separating Nondeterministic Time Complexity Classes

Journal of the ACM (JACM)
Probabilistic Two-Way Machines

Proceedings on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that under some truth-table oracle B there are almost exponential gaps in the (infinite often) hierarchy of boundederror probabilistic time, in particular BPPttB = ZPTIMEttB(n). This proves a main theorem in [5], which is extended to the theoretical limit.