A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Probabilistic computation and linear time
1989
Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89
Preserved Fulltext
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 P 2 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. We also note that probabilistic linear time can not contain both NP and BPP, implying that
doi:10.1145/73007.73021
dblp:conf/stoc/FortnowS89
fatcat:hxyksoak6fafpnabyotzr4xdhy