Author:
Bienvenu Laurent,Desfontaines Damien,Shen Alexander
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Bienvenu, L., Muchnik, A., Shen, A., Vereshchagin, N.: Limit complexities revisited [once more]. Technical report (2012). arxiv:1204.0201
2. Lecture Notes in Computer Science;L Bienvenu,2012
3. Lecture Notes in Computer Science;CS Calude,1998
4. Calude, C., Nies, A., Staiger, L., Stephan, F.: Universal recursively enumerable sets of strings. Theoretical Computer Science 412(22), 2253–2261 (2011)
5. Theory and Applications of Computability;R Downey,2010
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献