Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference22 articles.
1. Relative to a random oracle, PA ≠ NPA ≠ co-NPA with probability one;Bennett;SIAM J. Comput.,1981
2. On collapsing the polynomial-time hierarchy;Book;Inform. Process. Lett.,1994
3. The complexity of generating and checking proofs of membership;Buhrman,1996
4. The random oracle hypothesis is false;Chang;J. Computer System Sci.,1994
5. Gap-definable counting classes;Fenner;J. Computer System Sci.,1994
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献