Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference12 articles.
1. Reducibility, randomness, and intractability;Adleman;Ninth Annual ACM Symposium on Theory of Computing,1977
2. Relative to a random oracle A, PA ≠ NPA ≠ co-NPA with probability 1;Bennett;SIAM J. Comput.,1981
3. Computational complexity of probabilistic Turing machines;Gill;SIAM J. Comput.,1977
4. Reducibilities among combinatorial problems;Karp,1972
5. Some connections between nonuniform and uniform complexity classes;Karp;Twelfth ACM Symposium on Theory of Computing,1980
Cited by
64 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献