The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory☆
Under an Elsevier user license
open archive
Keywords
Circuit complexity
Distinguishing complexity
FewEXP
Formula size
Kolmogorov complexity
NEXP
Cited by (0)
- ☆
Much of this material appeared in preliminary form as “Derandomization and Distinguishing Complexity” in the Proceedings of the 2003 IEEE Conference on Computational Complexity (Allender et al., 2003 [6]).
- 1
Partially supported by NSF grants DMS-0652582, CCF-0830133, and CCF-0832787.
- 2
Supported in part by NSF grant CCF-0514703 and by grants GA ČR 201/07/P276 and P202/10/0854, project No. 1M0021620808 of MŠMT ČR, Institutional Research Plan No. AV0Z10190503 and grant IAA100190902 of GA AV ČR.
- 3
This work was done while at York College, City University of New York.
Copyright © 2010 Elsevier Inc. All rights reserved.