Author:
Beame Paul,Cook Stephen,Edmonds Jeff,Impagliazzo Russell,Pitassi Toniann
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference16 articles.
1. M. Blum, R. Implagliazzo, Generic oracles and oracle classes, Proceedings 28th Annual IEEE Symposium on Foundations of Computer Science, Los Angeles, CA, October 1987, 118, 126
2. P. Beame, R. Implagliazzo, J. Krajı́ček, T. Pitassi, P. Pudlák, Lower bounds on Hilbert's nullstellensatz and propositional proofs, Proceedings 35th Annual IEEE Symposium on Foundations of Computer Science, Santa Fe, NM, November 1994, 794, 806
3. A tight relationship between generic oracles and type-2 complexity theory;Cook;Inform. & Comput.,1997
4. M. Fellows, N. Koblitz, Self-witnessing polynomial-time complexity and prime factorization, Proceedings, Structure in Complexity Theory, Seventh Annual IEEE Conference, Boston, MA, June 1992, 107, 110
5. J. Hartmanis, L. A. Hemachandra, One-way functions, robustness, and nonisomorphism ofNP, Proceedings, Structure in Complexity Theory, Second Annual IEEE Conference, Cornell University, Ithaca, NY, June 1987, 160, 174
Cited by
117 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献