Author:
Calude Cristian,Zimand Marius
Subject
General Computer Science,Theoretical Computer Science
Reference41 articles.
1. Measure on small complexity classes, with applications for BPP;Allender,1994
2. A machine-independent theory of the complexity of recursive functions;Blum;J. ACM,1967
3. On effective procedures for speeding up algorithms;Blum;J. ACM,1967
4. Computational complexity and the existence of complexity gaps;Borodin;J. ACM,1972
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Quantitative aspects of speed-up and gap phenomena;Mathematical Structures in Computer Science;2010-10
2. Quantitative Aspects of Speed-Up and Gap Phenomena;Lecture Notes in Computer Science;2009
3. Bibliography;North-Holland Mathematics Studies;2004
4. Automatic Forcing and Genericity: On the Diagonalization Strength of Finite Automata;Discrete Mathematics and Theoretical Computer Science;2003
5. Chapter 12 A bibliography of recursive analysis and recursive topology;Handbook of Recursive Mathematics - Volume 1: Recursive Model Theory;1998