Language compression and pseudorandom generators

Computational Complexity

Volumn 14, Issue 3, 2005, Pages 228-255

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

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

Data compression; Pseudorandom generators

Indexed keywords

EID: 29144439127     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00037-005-0199-5     Document Type: Conference Paper

References (24)

1. J. BALCÁZAR, J. DÍAZ & J. GABARRÓ (1995). Structural Complexity I. EATCS Monogr. Theoret. Comput. Sci. 11, Springer.
2. H. BUHRMAN, L. FORTNOW & S. LAPLANTE (2002). Resource bounded Kolmogorov complexity revisited. SIAM J. Comput. 31, 887-905.
3. H. BUHRMAN, S. LAPLANTE & P. BRO MILTERSEN (2000). New bounds for the language compression problem. In Proc. 15th IEEE Conference on Computational Complexity, IEEE, 126-130.
4. A. G. DYACHKOV & V. V. RYKOV (1982). Bounds on the length of disjunctive codes. Problemy Peredachi Informatsii 18, 7-13 (in Russian).
5. J. FEIGENBAUM & L. FORTNOW (1993). On the random-self-reducibility of complete sets. SIAM J. Comput. 22, 994-1005.
6. S. GOLDWASSER & S. MICALI (1984). Probabilistic encryption. J. Comput. System Sci. 28, 270-299.
7. F. HENNIE & R. STEARNS (1966). Two-tape simulation of multitape Turing machines. J. ACM 13, 533-546.
8. A. KLIVANS & D. VAN MELKEBEEK (2002). Graph nonisomorphism has subexponential size proofs unless the polynomial hierarchy collapses. SIAM J. Comput. 31, 1501-1526.
9. R. KUMAR & D. SIVAKUMAR (1999). Proofs, codes, and polynomial-time reducibilities. In Proc. 14th IEEE Conference on Computational Complexity, IEEE, 46-53.
10. T. LEE & A. ROMASHCHENKO (2004). On polynomially time bounded symmetry of information. In 29th International Symposium on the Mathematical Foundations of Computer Science, J. Fiala, V. Koubek & J. Kratochvil (eds.), Lecture Notes in Comput. Sci. 3153, Springer, 463-475.
11. M. LI & P. VITÁNYI (1997). An Introduction to Kolmogorov Complexity and its Applications. 2nd ed., Springer, New York.
12. N. NISAN & A. WIGDERSON (1994). Hardness vs. randomness. J. Comput. System Sci. 49, 149-167.
13. C. PAPADIMITRIOU (1994). Computational Complexity. Addison-Wesley.
14. R. RAZ, O. REINGOLD & S. VADHAN (2002). Extracting all the randomness and reducing the error in Trevisan's extractors. J. Comput. System Sci. 65, 97-128.
15. A. SELMAN (1996). Much ado about functions. In Proc. 11th IEEE Conference on Computational Complexity, IEEE, 198-212.
16. R. SHALTIEL (2002). Recent developments in explicit construction of extractors. Bull. Eur. Assoc. Theoret. Comput. Sci. 77, 67-95.
17. R. SHALTIEL & C. UMANS (2001). Simple extractors for all min-entropies and a new pseudo-random generator. In Proc. 42nd IEEE Symposium on Foundations of Computer Science, IEEE, 648-657.
18. M. SIPSER (1983). A complexity theoretic approach to randomness. In Proc. 15th ACM Symposium on the Theory of Computing, ACM, 330-335.
19. M. SUDAN (1997). Decoding of Reed Solomon codes beyond the error-correction bound. J. Complexity 13, 180-193.
20. M. SUDAN, L. TREVISAN & S. VADHAN (2001). Pseudorandom generators without the XOR lemma. J. Comput. System Sci. 62, 236-266.
21. A. TA-SHMA, C. UMANS & D. ZUCKERMAN (2001a). Loss-less condensers, unbalanced expanders, and extractors. In Proc. 33rd ACM Symposium on the Theory of Computing, ACM, 143-152.
22. A. TA-SHMA, D. ZUCKERMAN & S. SAFRA (2001b). Extractors from Reed-Muller codes. In Proc. 42nd IEEE Symposium on Foundations of Computer Science, IEEE, 638-647.
23. L. TREVISAN (2001). Construction of extractors using pseudo-random generators. J. ACM 48, 860-879.
24. C. UMANS (2003). Pseudo-random generators for all hardnesses. J. Comput. System Sci. 67, 419-440.