Author:
Hitchcock John M.,Shafei Hadi
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference15 articles.
1. K. Ambos-Spies (1983). P-mitotic sets. In Logic and Machines: Decision Problems and Complexity, Proceedings of the Symposium ”Rekursive Kombinatorik” held from May 23-28, 1983 at the Institut für Mathematische Logik und Grundlagenforschung der Universität Münster/Westfalen, 1–23.
2. Ambos-Spies K., Bentzien L. (2000) Separating NP-Completeness Notions Under Strong Hypotheses. Journal of Computer and System Sciences 61(3): 335–361
3. Ambos-Spies K., Fleischhack H., Huwig H. (1987) Diagonalizations over polynomial time computable sets. Theoretical Computer Science 51: 177–204
4. Beigel R., Feigenbaum J. (1992) On being incoherent without being very hard. Computational Complexity 2: 1–17
5. Buhrman H., Fortnow L., van Melkebeek D., Torenvliet L. (2000) Separating complexity classes using autoreducibility. SIAM Journal on Computing 29(5): 1497–1520
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Nonuniform Reductions and NP-Completeness;Theory of Computing Systems;2022-06-01