Extracting kolmogorov complexity with applications to dimension zero-one laws

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4051 LNCS, Issue , 2006, Pages 335-345

  Fortnow, Lance ^a   Hitchcock, John M ^b   Pavan, A ^c   Vinodchandran, N V ^d   Wang, Fengming ^c  

^a THE UNIVERSITY OF CHICAGO   (United States)

^b UNIVERSITY OF WYOMING   (United States)

^c Iowa State University   (United States)

^d UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; MATHEMATICAL MODELS; NUMERICAL METHODS; POLYNOMIAL APPROXIMATION;

ESPACE; KOLMOGOROV COMPLEXITY; SPACE-BOUNDED KOLMOGOROV COMPLEXITY; ZERO-ONE LAWS;

RANDOM PROCESSES;

EID: 33746370422     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_30     Document Type: Conference Paper

References (22)

1. K. B. Athreya, J. M. Hitchcock, J. H. Lutz, and E. Mayordomo. Effective strong dimension in algorithmic information and computational complexity. SIAM Journal on Computing. To appear.
2. B. Barak, R. Impagliazzo, and A. Wigderson. Extracting randomness using few independent sources. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pages 384-393. IEEE Computer Society, 2004.
3. B. Barak, G. Kindler, R. Shaltiel, B. Sudakov, and A. Wigderson. Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors. In Proceedings of the 37th ACM Symposium on Theory of Computing, pages 1-10, 2005.
4. B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. In Proceedings of the 26th Annual IEEE Conference on Foundations of Computer Science, pages 429-442, 1985.
5. J. M. Hitchcock. Effective fractal Dimension: Foundations and Applications. PhD thesis, Iowa State University, 2003.
6. J. M. Hitchcock, J. H. Lutz, and E. Mayordomo. The fractal geometry of complexity classes. SIGACT News, 36(3):24-38, September 2005.
7. J. M. Hitchcock and A. Pavan. Resource-bounded strong dimension versus resource-bounded category. Information Processing Letters, 95(3):377-381, 2005.
8. M. Li and P. M. B. Vitányi. An Introduction to Kolmogorov Complexity and its Applications. Springer-Verlag, Berlin, 1997. Second Edition.
9. C-J. Lu, O. Reingold, S. Vadhan, and A. Wigderson. Extractors: Optimal up to a constant factor. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 602-611, 2003.
10. J. H. Lutz. Almost everywhere high nonuniform complexity. Journal of Computer and System Sciences, 44(2):220-258, 1992.
11. J. H. Lutz. Dimension in complexity classes. SIAM Journal on Computing, 32(5):1236-1259, 2003.
12. N. Nisan and A. Ta-Shma. Extracting randomness: A survey and new constructions. Journal of Computer and System Sciences, 42(2): 149-167, 1999.
13. N. Nisan and D. Zuckerman. Randomness is linear in space. Journal of Computer and System Sciences, 52(1):43-52, 1996.
14. R. Raz. Extractors with weak random seeds. In Proceedings of the 37th ACM Symposium on Theory of Computing, pages 11-20, 2005.
15. O. Reingold, R. Shaltiel, and A. Wigderson. Extracting randomness via repeated condensing, In Proceedings of the 41st Annual Conference on Foundations of Computer science, 2000.
16. O. Reingold, S. Vadhan, and A. Wigderson. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. In Proceedings of the 41st Annual IEEE Conference on Foundations of Computer Science, 2000.
17. M. Santha and U. Vazirani. Generating quasi-random sequences from slightly random sources. In Proceedings of the 25th Annual IEEE Conference on Foundations of Computer Science, pages 434-440, 1984.
18. R. Shaltiel and C. Umans, Simple extractors for all min-entropies and a new pseudo-random generator. In Proceedings of the 42nd Annual Conference on Foundations of Computer Science, 2001.
19. A. Srinivasan and D. Zuckerman. Computing with very weak random sources. SIAM Journal on Computing, 28(4):1433-1459, 1999.
20. A. Ta-Shma, D. Zuckerman, and M. Safra. Extractors from reed-muller codes. In Proceedings of the 42nd Annual Conference on Foundations of Computer Science, 2001.
21. L. Trevisan. Extractors and pseudorandom generators. Journal of the ACM, 48(1):860-879, 2001.
22. D. Zuckerman. Randomness-optimal oblivious sampling. Random Structures and Algorithms, 11:345-367, 1997.