An Introduction to Kolmogorov Complexity and Its Applications

[1]  Lance Fortnow,et al.  Resource-Bounded Kolmogorov Complexity Revisited , 1997, STACS.

[2]  Jaap-Henk Hoepman,et al.  Optimal routing tables , 1996, PODC '96.

[3]  Harry Buhrman,et al.  Compressibility and Resource Bounded Measure , 2001, SIAM J. Comput..

[4]  Osamu Watanabe,et al.  On Random Hard Sets for NP , 1996, Inf. Comput..

[5]  Andris Ambainis.  Application of Kolmogorov Complexity to Inductive Inference with Limited Memory , 1995, ALT.

[6]  Harry Buhrman,et al.  An excursion to the Kolmogorov random strings , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

[7]  José L. Balcázar,et al.  Learnability of Kolmogorov-easy circuit expressions via queries , 1995, EuroCOLT.

[8]  Juris Hartmanis,et al.  On Hausdorff and Topological Dimensions of the Kolmogorov Complexity of the Real Line , 1994, J. Comput. Syst. Sci..

[9]  Pekka Orponen,et al.  Random strings make hard instances , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[10]  Ronald V. Book.  Relativizations of the P =? NP and Other Problems: Developments in Structural Complexity Theory , 1994, SIAM Rev..

[11]  Péter Gács,et al.  Thermodynamics of computation and information distance , 1993, STOC.

[12]  Edith Hemaspaandra,et al.  SPARSE reduces conjunctively to TALLY , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[13]  Jack H. Lutz,et al.  On Languages With Very High Space-Bounded Kolmogorov Complexity , 1993, SIAM J. Comput..

[14]  Aaron D. Wyner,et al.  Computability by Probabilistic Machines , 1993 .

[15]  José L. Balcázar,et al.  Logarithmic Advice Classes , 1992, Theor. Comput. Sci..

[16]  E. Allender.  Applications of Time-Bounded Kolmogorov Complexity in Complexity Theory , 1992 .

[17]  Ronald V. Book.  On Sets with Small Information Content , 1992 .

[18]  Andrew R. Barron,et al.  Minimum complexity density estimation , 1991, IEEE Trans. Inf. Theory.

[19]  David Haussler,et al.  Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.

[20]  V. Arnold.  A few words on Andrei Nikolaevich Kolmogorov , 1988 .

[21]  Eric Allender,et al.  P-Printable Sets , 1988, SIAM J. Comput..

[22]  Zvi Galil,et al.  On pointers versus addresses , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[23]  Charles H. Bennett.  Logical depth and physical complexity , 1988 .

[24]  Osamu Watanabe,et al.  Kolmogorov complexity and degrees of tally sets , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[25]  Osamu Watanabe,et al.  Lowness Properties of Sets in the Exponential-Time Hierarchy , 1988, SIAM J. Comput..

[26]  Cristian S. Calude.  Theories of computational complexity , 1988 .

[27]  Eric Allender,et al.  Some consequences of the existence of pseudorandom generators , 1987, J. Comput. Syst. Sci..

[28]  Yaser S. Abu-Mostafa.  The complexity of information extraction , 1986, IEEE Trans. Inf. Theory.

[29]  R. Landauer,et al.  The Fundamental Physical Limits of Computation. , 1985 .

[30]  Charles H. Bennett,et al.  The thermodynamics of computation—a review , 1982 .

[31]  V. Alekseev,et al.  Symbolic dynamics and hyperbolic dynamic systems , 1981 .

[32]  A. Brudno.  Entropy and the complexity of the trajectories of a dynamical system , 1978 .

[33]  P. Benioff.  Models of Zermelo Frankel set theory as carriers for the mathematics of physics. II , 1976 .

[34]  Manuel Blum.  On the Size of Machines , 1967, Inf. Control..

[35]  G. S. Martin.  Dissipation , 1904, The American journal of dental science.