Summary: The Pervasive Reach of Resource-Bounded Kolmogorov
Complexity in Computational Complexity Theory
Piscataway, NJ, USA
Institute of Mathematics of the Academy of Sciences of the Czech Republic
Prague, Czech Republic
India Research Laboratory, IBM, New Delhi, India
Much of this material appeared in preliminary form as "Derandomization and Distinguishing Complexity" in the proceedings of the 2003
IEEE Conference on Computational Complexity [AKRR03].
Partially supported by NSF grants DMS-0652582, CCF-0830133, and CCF-0832787. Some of this work was performed while this author
was a visiting scholar at the University of Cape Town.