| | |
Summary: When Worlds Collide:
Derandomization, Lower Bounds, and
Kolmogorov Complexity
Eric Allender
Department of Computer Science
Rutgers University
Piscataway, NJ 08854-8019, USA
allender@cs.rutgers.edu
http://www.cs.rutgers.edu/
~
allender
c Springer-Verlag
Abstract. This paper has the following goals:
To survey some of the recent developments in the field of derandom-
ization.
To introduce a new notion of time-bounded Kolmogorov complex-
ity (KT), and show that it provides a useful tool for understanding
advances in derandomization, and for putting various results in con-
text.
To illustrate the usefulness of KT, by answering a question that has
|
