Compression of samplable sources

Computational Complexity

Volumn 14, Issue 3, 2005, Pages 186-227

  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

Approximate counting; Arithmetic coding; Expander graphs; Pseudorandom generators; Randomized logspace

Indexed keywords

EID: 29144496911     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00037-005-0198-6     Document Type: Conference Paper

References (45)

1. M. ADLER & M. MITZENMACHER (2001). Toward compressing web graphs. In Proc. 2001 Data Compression Conference.
2. E. ALLENDER, D. BRUSCHI & G. PIGHIZZINI (1993). The complexity of computing maximal word functions. Comput. Complexity 3, 368-391.
3. S. ARORA, F. T. LEIGHTON & B. M. MAGGS (1996). On-line algorithms for path selection in a nonblocking network. SIAM J. Comput. 25, 600-625.
4. B. BARAK, R. SHALTIEL & A. WIGDERSON (2003). Computational analogues of entropy. In Approximation, Randomization, and Combinatorial Optimization, Lecture Notes in Comput Sci. 2764, Springer, 200-215.
5. H. BUHRMAN, T. LEE & D. VAN MELKEBEEK (2004). Language compression and pseudorandom generators. Comput. Complexity 14, 228-255.
6. M. CAPALBO, O. REINGOLD, S. VADHAN & A. WIGDERSON (2002). Randomness conductors and constant-degree lossless expanders. In Proc. 34th Annual ACM Symposium on Theory of Computing, 659-668.
7. B. CHOR & O. GOLDREICH (1988). Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput. 17, 230-261.
8. T. M. COVER & J. A. THOMAS (1991). Elements of Information Theory. Wiley.
9. W. DIFFIE & M. E. HELLMAN (1976). New directions in cryptography. IEEE Trans. Inform. Theory IT-22, 644-654.
10. A. V. GOLDBERG & M. SIPSER (1991). Compression and ranking. SIAM J. Comput. 20, 524-536.
11. O. GOLDREICH & S. VADHAN (1999). Comparing entropies in statistical zero-knowledge with applications to the structure of SZK. In Proc. 14th Annual IEEE Conference on Computational Complexity, 54-73.
12. J. HÅSTAD, R. IMPAGLIAZZO, L. A. LEVIN & M. LUBY (1999). A pseudorandom generator from any one-way function. SIAM J. Comput. 28, 1364-1396.
13. R. IMPAGLIAZZO (1999). Remarks in Open Problems session at the DIMACS Workshop on Pseudorandomness and Explicit Combinatorial Constructions.
14. R. IMPAGLIAZZO & A. WIGDERSON (1997). P = BPP if E requires exponential circuits: derandomizing the XOR lemma. In Proc. 29th Annual ACM Symposium on Theory of Computing, 220-229.
15. M. JERRUM & A. SINCLAIR (1989). Approximating the permanent. SIAM J. Comput. 18, 1149-1178.
16. M. JERRUM & A. SINCLAIR (1996). The Markov chain Monte Carlo method: an approach to approximate counting and integration. In Approximation Algorithms for NP-hard Problems, D. S. Hochbaum (ed.), chapter 12, PWS Publ., 482-520.
17. M. JERRUM, A. SINCLAIR & E. VIGODA (2001). A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. In Proc. 33rd Annual ACM Symposium on Theory of Computing, 712-721.
18. M. R. JERRUM, L. G. VALIANT & V. V. VAZIRANI (1986). Random generation of combinatorial structures from a uniform distribution. Theoret. Comput. Sci. 43, 169-188.
19. R. KANNAN (1994). Markov chains and polynomial time algorithms. In Proc. 35th Annual IEEE Symposium on Foundations of Comput. Science, 656-671.
20. R. M. KARP, M. LUBY & N. MADRAS (1989). Monte Carlo approximation algorithms for enumeration problems. J. Algorithms 10, 429-448.
21. M. KHARITONOV, A. V. GOLDBERG & M. YUNG (1989). Lower bounds for pseudorandom number generators. In Proc. 30th Annual IEEE Symposium on Foundations of Computer Science, 242-247.
22. M. LI & P. VITÁNYI (1997). An Introduction to Kolmogorov Complexity. 2nd ed., Springer.
23. R. J. LIPTON (1994). A new approach to information theory. In Proc. 11th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 775, Springer, 699-708.
24. M. LUBY & E. VIGODA (1999). Fast convergence of the Glauber dynamics for sampling independent sets. Random Structures Algorithms 15, 229-241.
25. B. MORRIS & A. SINCLAIR (1999). Random walks on truncated cubes and sampling 0-1 knapsack solutions (preliminary version). In Proc. 40th Annual IEEE Symposium on Foundations of Computer Science, 230-240.
26. N. NISAN & A. WIGDERSON (1994). Hardness vs. randomness. J. Comput. System Sci. 49, 149-167.
27. N. NISAN & D. ZUCKERMAN (1996). Randomness is linear in space. J. Comput. System Sci. 52, 43-52.
28. R. OSTROVSKY (1991). One-way functions, hard on average problems, and statistical zero-knowledge proofs. In Proc. 6th Annual Structure in Complexity Theory Conference (Chicago, IL), IEEE Comput. Soc. Press, 133-138.
29. R. OSTROVSKY & A. WIGDERSON (1993). One-way fuctions are essential for non-trivial zero-knowledge. In Proc. Isreali Symposium on Theoretical Computer Science, 3-17.
30. D. RANDALL (2003). Mixing. In Proc. 44th Annual IEEE Symposium on Foundations of Computer Science, 4-15.
31. R. RAZ & O. REINGOLD (1999). On recycling the randomness of states in space bounded computation. In Proc. 31st Annual ACM Symposium on Theory of Computing, 159-168.
32. O. REINGOLD, S. VADHAN & A. WIGDERSON (2000). Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. In Proc. 41st Annual IEEE Symposium on Foundations of Computer Science, 3-13.
33. A. SAHAI & S. VADHAN (2003). A complete problem for statistical zero knowledge. J. ACM 50, 196-249.
34. Extended abstract in FOCS '97.
35. M. SANTHA & U. V. VAZIRANI (1986). Generating quasi-random sequences from semi-random sources. J. Comput. System Sci. 33, 75-87.
36. C.-P. SCHNORR (1976). Optimal algorithms for self-reducible problems. In Proc. 3rd International Colloquium on Automata, Languages, and Programming, 322-337.
37. C. E. SHANNON (1949). Communication theory of secrecy systems. Bell. System Technical J. 28, 656-715.
38. A. J. SINCLAIR & M. R. JERRUM (1989). Approximate counting, uniform generation and rapidly mixing Markov chains. Inform. and Comput. 82, 93-133.
39. A. TA-SHMA, C. UMANS & D. ZUCKERMAN (2001). Loss-less condensers, unbalanced expanders, and extractors. In Proc. 33rd Annual ACM Symposium on Theory of Computing, 143-152.
40. L. TREVISAN, S. VADHAN & D. ZUCKERMAN (2004). Compression of samplable sources. In Proc. 19th Annual IEEE Conference on Computational Complexity, 1-14.
41. L. TREVISAN & S. P. VADHAN (2000). Extracting randomness from samplable distributions. In Proc. 41st Annual IEEE Symposium on Foundations of Computer Science, 32-42.
42. L. G. VALIANT & V. V. VAZIRANI (1986). N P is as easy as detecting unique solutions. Theoret. Comput. Sci. 47, 85-93.
43. H. WEE (2004). On pseudoentropy versus compressibility. In Proc. 19th Annual IEEE Conference on Computational Complexity, 29-41.
44. A. C. YAO (1982). Theory and applications of trapdoor functions. In Proc. 23rd Annual IEEE Symposium on Foundations of Computer Science, 80-91.
45. J. ZIV & A. LEMPEL (1978). Compression of individual sequences by variable rate coding. IEEE Trans. Inform. Theory 24, 530-536.