Author:
Ambos-Spies Klaus,Homer Steven,Yang Dongping
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. K. Ambos-Spies, Honest Polynomial Reducibilities, Recursively Enumerable Sets, and the P=?NP Problem, Second Annual Structure in Complexity Theory Conference, 60–68.
2. K. Ambos-Spies, Honest Polynomial Time Reducibilities and the P=?NP Problem, JCSS 39, 250–281.
3. T. Baker, J. Gill and R. Solovay, Relativizations of P=?NP Question, SIAM Journal of Computer Science 1, 305–322.
4. S.I. Breidbart, On Splitting Recursive Sets, JCSS 17, 56–64.
5. R. Downey, On Computational Complexity and Honest Polynomial Degrees, Theoretical Computer Science, to appear.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献