Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference7 articles.
1. Relative to a random oracle A, PA≠NPA≠CoNpA with probability 1;Bennett;SIAM J. Comput.,1981
2. Computational complexity of probabilistic Turing machines;Gill;SIAM J. Comput.,1977
3. Some observations on the probabilistic algorithms and NP-hard problems;Ko;Inform. Process. Lett.,1982
4. On two computational models for probabilistic algorithms;Lautemann,1982
5. A complexity theoretic approach to randomness;Sipser;Proc. 15th Ann. ACM Symp. on Theoretical Computer Science,1983
Cited by
144 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献