DMCA
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity (1997)
Cached
Download Links
- [ftp.cs.rutgers.edu]
- [athos.rutgers.edu]
- [www.cs.rutgers.edu]
- [ftp.cs.rutgers.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | OF REDUCTIONS,IN“PROC.29THACM SYMPOSIUM ON THEORY OF COMPUTING |
| Citations: | 17 - 5 self |
BibTeX
@INPROCEEDINGS{Allender97whenworlds,
author = {Eric Allender},
title = {When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity},
booktitle = {OF REDUCTIONS,IN“PROC.29THACM SYMPOSIUM ON THEORY OF COMPUTING},
year = {1997},
pages = {730--738},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper has the following goals: -- To survey some of the recent developments in the field of derandomization. -- To introduce a new notion of time-bounded Kolmogorov complexity (KT), and show that it provides a useful tool for understanding advances in derandomization, and for putting various results in context. -- To illustrate the usefulness of KT, by answering a question that has been posed in the literature, and -- To pose some promising directions for future research.
