Author:
Ambos-Spies Klaus,Bakibayev Timur
Subject
General Computer Science,Theoretical Computer Science
Reference12 articles.
1. Nontriviality for exponential time w.r.t. weak reducibilities;Ambos-Spies,2010
2. Weak completeness notions for exponential time;Ambos-Spies,2010
3. Comparing nontriviality for E and EXP;Ambos-Spies;Theory of Computing Systems,2012
4. K. Ambos-Spies, E. Mayordomo, X. Zheng, A comparison of weak completeness notions, in: Proceedings of the 11th Annual IEEE Conference on Computational Complexity, 1996, pp. 171–178.
5. Structural Complexity I;Balcázar,1995
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献