Subject
General Computer Science,Theoretical Computer Science
Reference19 articles.
1. On counting problems and the polynomial-time hierarchy;Angluin;Theoret. Comput. Sci.,1980
2. Relativizations of the P = NP questions;Baker;SIAM J. Comput.,1975
3. A second step toward the polynomial-time hierarchy;Baker;Theoret. Comput. Sci.,1979
4. The polynomial-time hierarchy and sparse oracles;Balcázar;J. ACM,1986
5. On the power of probabilistic polynomial time: PNP(log) ⊆ PP;Biegel;Proc. 4th IEEE SICT Conf.,1989
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献