Author:
Hitchcock John M.,Pavan A.,Vinodchandran N. V.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference25 articles.
1. Ambos-Spies, K., Bentzien, L.: Separating NP-completeness under strong hypotheses. J. Comput. Syst. Sci. 61(3), 335–361 (2000)
2. Balcázar, J., Schöning, U.: Bi-immune sets for complexity classes. Math. Syst. Theory 18(1), 1–18 (1985)
3. Buhrman, H., Torenvliet, L.: On the structure of complete sets. In: 9th IEEE Annual Conference on Structure in Complexity Theory, pp. 118–133 (1994)
4. Buhrman, H., Homer, S., Torenvliet, L.: Completeness notions for nondeterministic complexity classes. Math. Syst. Theory 24, 179–200 (1991)
5. Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd ACM Symposium on Theory of Computing, pp. 151–158 (1971)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献