Language compression and pseudorandom generators

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 19, Issue , 2004, Pages 15-28

  Buhrman, Harry ^a   Lee, Troy ^a   Van Melkebeek, Dieter ^b  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTHUR-MERLIN PROTOCOLS; DECOMPRESSION; LANGUAGE COMPRESSION; PSEUDORANDOM GENERATORS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; INFORMATION ANALYSIS; NETWORK PROTOCOLS; POLYNOMIALS; PROBABILITY; SET THEORY;

DATA COMPRESSION;

EID: 4944221184     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. S. Aaronson. The complexity zoo. http:///www.cs.berkeley.edu/~aaronson/ zoo.html.
2. J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I, volume 11 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1995.
3. H. Buhrman, L. Fortnow, and S. Laplante. Resource bounded Kolmogorov complexity revisited. SIAM Journal on Computing, 31(3) :887-905, 2002.
4. H. Buhrman, S. Laplante, and P. Bro Miltersen. New bounds for the language compression problem. In Proceedings of the 15th IEEE Conference on Computational Complexity, pages 126-130. IEEE, 2000.
5. A. G. Dyachkov and V. V. Rykov. Bounds on the length of disjunctive codes. Problemy Peredachi Informatsii, 18:7-13, 1982. In Russian.
6. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28:270-299, 1984.
7. F. Hennie and R. Stearns. Two-tape simulation of multitape Turing machines. Journal of the ACM, 13:533-546, 1966.
8. A. Klivans and D. van Melkebeek. Graph nonisomorphism has subexponential size proofs unless the polynomial hierarchy collapses. SIAM Journal on Computing, 31(5):1501-1526, 2002.
9. R. Kumar and D. Sivakumar. Proofs, codes, and polynomial-time reducibilities. In Proceedings of the 14th IEEE Conference on Computational Complexity, pages 46-53. IEEE, 1999.
10. T. Lee and A. Romashchenko. On polynomially time bounded symmetry of information. Submitted, 2004. Available at http://www.cwi.nl//~tlee/syminfo.ps.
11. M. Li and P. Vitányi. An Introduction to Kolmogorov Complexity and its Applications. Springer-Verlag, New York, second edition, 1997.
12. N. Nisan and A. Wigderson. Hardness vs. randomness. Journal of Computer and System Sciences, 49:149-167, 1994.
13. C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
14. R. Raz, O. Reingold, and S. Vadhan. Extracting all the randomness and reducing the error in Trevisan's extractors. In Proceedings of the 31st ACM Symposium on the Theory of Computing, pages 149-158. ACM, 1999.
15. R. Shaltiel. Recent developments in explicit construction of extractors. Bulletin of the European Association for Theoretical Computer Science, 77:67-95, 2002.
16. R. Shaltiel and C. Umans. Simple extractors for all min-entropies and a new pseudo-random generator. In Proceedings of the 42st IEEE Symposium on Foundations of Computer Science, pages 648-657. IEEE, 2001.
17. M. Sipser. A complexity theoretic approach to randomness. In Proceedings of the 15th ACM Symposium on the Theory of Computing, pages 330-335. ACM, 1983.
18. M. Sudan. Decoding of Reed Solomon codes beyond the error-correction bound. Journal of Complexity, 13(1):180-193, 1997.
19. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR lemma. Technical Report TR-98-074, Electronic Colloquium on Computational Complexity, 1999. Revision 1.
20. A. Ta-Shma, C. Umans, and D. Zuckerman. Loss-less condensers, unbalanced expanders, and extractors. In Proceedings of the 33st ACM Symposium on the Theory of Computing, pages 143-152. ACM, 2001.
21. A. Ta-Shma, D. Zuckerman, and S. Safra. Extractors from Reed-Muller codes. In Proceedings of the 42st IEEE Symposium on Foundations of Computer Science, pages 638-647. IEEE, 2001.
22. L. Trevisan. Construction of extractors using pseudo-random generators. In Proceedings of the 31st ACM Symposium on the Theory of Computing, pages 141-148. ACM, 1999.
23. C. Umans. Pseudo-random generators for all hardnesses. In Proceedings of the 34st ACM Symposium on the Theory of Computing, pages 627-634. ACM, 2002.