Author:
Schöning Uwe,Pruim Randall
Publisher
Springer Berlin Heidelberg
Reference5 articles.
1. I. Niven, H.S. Zuckerman: An Introduction to the Theory of Numbers, Wiley, 1960.
2. W.J. Paul: Kolmogorov complexity and lower bounds, Foundations of Computation Theory, Akademie-Verlag, Berlin, 1979.
3. W.J. Paul, J.I. Seiferas, J. Simon: An information-theoretic approach to time bounds for on-line computation, Journal of Computer and System Sciences 23 (1981), 108–126.
4. M. Li, P. Vitanyi: Applications of Kolmogorov complexity in the theory of computation, in A.L. Selman, ed., Complexity Theory Retrospective, Springer, 1990, 147-203.
5. M. Li, P. Vitanyi: An Introduction to Kolmogorov Complexity and its Applications, 2nd edition, Springer, 1997.