Author:
Calude Cristian,Zimand Marius
Publisher
Springer Berlin Heidelberg
Reference40 articles.
1. E. Allender and M. Strauss. Measure on small complexity classes, with applications for BPP, FOCS'94, 1994, 807–818.
2. M. Blum. A machine-independent theory of the complexity of recursive functions, J. Assoc. Comput. Mach. 14(2) (1967), 322–336.
3. M. Blum. On effective procedures for speeding up algorithms, J. Assoc. Comput. Mach. 18(2) (1967), 257–265.
4. A. Borodin. Computational complexity and the existence of complexity gaps, J. Assoc. Comput. Mach. 19(1) (1972), 158–174.
5. D. S. Bridges. Computability—A Mathematical Sketchbook, Springer-Verlag, Berlin, 1994.