Author:
Bennison Victor L.,Soare Robert I.
Subject
General Computer Science,Theoretical Computer Science
Reference24 articles.
1. On the computational complexity of recursively enumerable sets;Bennison,1976
2. V.L. Bennison, Recursively enumerable complexity sequences and measure independence (to appear).
3. A machine-independent theory of the complexity of recursive functions;Blum;J. Assoc. Comput. Mach.,1967
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献