Author:
Cook Stephen,Impagliazzo Russell,Yamakami Tomoyuki
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference30 articles.
1. Relativizations of thePNP;Baker;SIAM J. Computing,1975
2. P. Beame, S. Cook, J. Edmonds, R. Impagliazzo, T. Pitassi, 1995, The relative complexity of NP search problems, Proceedings, 27th ACM Symposium on Theory of Computing, 303, 314
3. M. Blum, R. Impagliazzo, 1987, Generic oracles and oracle classes, Proceedings, 28th IEEE Symposium on Foundations of Computer Science, 118, 126
4. The independence of the continuum hypothesis, I, II;Cohen;Proc. Natl. Acad. Sci. U.S.A.,1963
5. R. L. Constable, 1973, Type two computable functionals, Proceedings, 5th ACM Symposium on Theory of Computing, 108, 121
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献