Compression of samplable sources

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 19, Issue , 2004, Pages 1-14

  Trevisan, Luca ^a   Vadhan, Salil ^b   Zuckerman, David ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b HARVARD UNIVERSITY   (United States)

^c University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECOMPRESSION; MEMBERSHIP ALGORITHMS; RANDOM SOURCES; SAMPLABLE SOURCES;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ENTROPY; INFORMATION THEORY; POLYNOMIALS; RANDOM PROCESSES; SET THEORY;

DATA COMPRESSION;

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

References (30)

1. M. Adler and M. Mitzenmacher. Toward compressing web graphs. In Proceedings of the 2001 Data Compression Conference, 2001.
2. E. Allender, D. Bruschi, and G. Pighizzini. The complexity of computing maximal word functions. Computational Complexity, 3(4):368-391, 1993.
3. S. Arora, F. T. Leighton, and B. M. Maggs. On-line algorithms for path selection in a nonlocking network. SIAM Journal on Computing, 25(3):600-625, 1996.
4. B. Barak, R. Shaltiel, and A. Wigderson. Computational analogues of entropy. In 11th International Conference on Random Structures and Algorithms, 2003.
5. M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson. Randomness conductors and constant-degree lossless expanders. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 659-668, 2002.
6. B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal on Computing, 17(2):230-261, 1988.
7. T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley & Sons, Inc., 1991.
8. W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Transactions in Information Theory, IT-22(6):644-654, 1976.
9. A. Goldberg and M. Sipser. Compression and ranking. SIAM Journal on Computing, 20:524-536, 1991.
10. O. Goldreich and S. Vadhan. Comparing entropies in statistical zero-knowledge with applications to the structure of SZK. In Proc. of Conference on Computational Complexity, pages 54-73, 1999.
11. J. Håstad, R. Impagliazzo, L. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM Journal on Computing, 28:1364-1396, 1999.
12. R. Impagliazzo, October 1999. Remarks in Open Problem session at the DIMACS Workshop on Pseudorandomness and Explicit Combinatorial Constructions.
13. R. Impagliazzo and A. Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 220-229, 1997.
14. M. Jerrum and A. Sinclair. Approximating the permanent. SIAM Journal on Computing, 18(6): 1149-1178, 1989.
15. M. Jerrum, A. Sinclair, and E. Vigoda. A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pages 712-721, 2001.
16. M. Jerrum, L. Valiant, and V. Vazirani. Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science, 43:169-188, 1986.
17. M. Kharitonov, A. V. Goldberg, and M. Yung. Lower bounds for pseudorandom number generators. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, pages 242-247, 1989.
18. R. Lipton. A new approach to information theory. In Proc. o f11th Symposium on Theoretical Aspects of Computer Science, pages 699-708, 1994.
19. N. Nisan and A. Wigderson. Hardness vs. randomness. Journal of Computer and System Sciences, 49:149-167, 1994.
20. A. Sahai and S. Vadhan. A complete problem for statistical zero knowledge. Journal of the ACM, 50(2): 196-249, March 2003. Extended abstract in FOCS '97.
21. M. Santha and U. V. Vazrrani. Generating quasi-random sequences from semi-random sources. Journal of Computer and System Sciences, 33:75-87, 1986.
22. C. Schnorr. Optimal algorithms for self-reducible problems. In Proceedings of the 3rd International Colloquium on Automata, Languages, and Programming, pages 322-337, 1976.
23. C. E. Shannon. Communication theory of secrecy systems. Bell System Technical Journal, 28:656-715, 1949.
24. A. Sinclair and M. Jerrum, Approximate counting, uniform generation and rapidly mixing Markov chains. Information and Computation, 82:93-133, 1989.
25. A. Ta-Shma, C. Umans, and D. Zuckerman. Lossless condensers, unbalanced expanders, and extractors. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pages 143-152, 2001.
26. L. Trevisan and S. P. Vadhan. Extracting randomness from samplable distributions. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 32-42, 2000.
27. H. Wee. On pseudoentropy versus compressibility. These Proceedings, 2004.
28. A. C. Yao. Theory and applications of trapdoor functions. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, pages 80-91, 1982.
29. J. Ziv and A. Lempel. Compression of individual sequences by variable rate coding. IEEE Transactions on Information Theory, 24:530-536, 1978.
30. D. Zuckerman. Randomness-optimal oblivious sampling. Random Structures and Algorithms, 11:345-367, 1997.