Subject
General Computer Science,Theoretical Computer Science
Reference13 articles.
1. D. Alton, Diversity of speed-ups and embeddability in computational complexity, J. Symbolic Logic (to appear).
2. Operator embeddability in computational complexity;Alton;Notices Am. Math. Soc.,1972
3. On classes of computable functions;Basu;ACM Symp. on Theory of Computing,1969
4. A machine-independent theory of the complexity of recursive functions;Blum;J. ACM,1967
5. Classes of computable functions defined by bounds on computation;McCreight,1969
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献