Author:
Hemaspaandra L. A.,Zimand M.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference49 articles.
1. E. Allender. Oracles versus proof techniques that do not relativize. InProceedings of the 1990 SI-GAL International Symposium on Algorithms, pages 39–52. Lecture Notes in Computer Science, Vol. 450. Springer-Verlag, Berlin, 1990.
2. L. Babai. A random oracle separates PSPACE from the polynomial hierarchy.Information Processing Letters, 26(1):51–53, 1987.
3. R. Beigel. Bi-immunity results for cheatable sets.Theoretical Computer Science, 73:249–263, 1990.
4. C. Bennett and J. Gill. Relative to a random oracleA, PA ≠ NPA ≠ coNPA with probability 1.SIAM Journal on Computing, 10:96–113, 1981.
5. T. Baker, J. Gill, and R. Solovay. Relativizations of the P =? NP question.SIAM Journal on Computing, 4(4):431–442, 1975.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献