Author:
Ambos-Spies Klaus,Bakibayev Timur
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Ambos-Spies, K.: Honest polynomial time reducibilities and the P = ?NP problem. J. Comput. System Sci. 39, 250–281 (1989)
2. Lecture Notes in Computer Science;K. Ambos-Spies,1987
3. Ambos-Spies, K.: Polynomial time reducibilities and degrees. Stud. Logic Found. Math. 140, 683–705 (1999)
4. Ambos-Spies, K.: Resource-bounded genericity. London Math. Soc. Lecture Note Ser. 224, 1–59 (1996)
5. Ambos-Spies, K., Bakibayev, T.: Comparing nontriviality for E and EXP. Submitted for publication
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献