Pseudorandomness for approximate counting and sampling

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2005, Pages 212-226

  Shaltiel, Ronen ^a   Umans, Christopher ^b  

^a UNIVERSITY OF HAIFA   (Israel)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE COUNTING; POLY-SIZE NONDETERMINISTIC CIRCUITS; POLYNOMIAL TIME ALGORITHMS; PSEUDORANDOMNESS;

APPROXIMATION THEORY; NETWORKS (CIRCUITS); POLYNOMIALS; PROBABILISTIC LOGICS; RELATIONAL DATABASE SYSTEMS;

RANDOM NUMBER GENERATION;

EID: 27644565809     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2005.26     Document Type: Conference Paper

References (33)

1. E. Allender, M. Koucky, D. Ronneburger, and S. Roy. Derandomization and distinguishing complexity. In Proc. 18th Annual IEEE Conference on Computational Complexity, pages 209-220, 2003.
2. V. Arvind and J. Kobler. On pseudorandomness and resource-bounded measure. TCS: Theoretical Computer Science, 255, 2001.
3. L. Babai. Trading group theory for randomness. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, 1985.
4. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity, 3(4):307-318, 1993.
5. D. Beaver and J. Feigenbaum. Hiding instances in multioracle queries. In 7th Annual Symposium on Theoretical Aspects of Computer Science, volume 415 of lncs, pages 37-48, Rouen, France, 22-24 Feb. 1990. Springer.
6. M. Bellare, O. Goldreich, and E. Petrank. Uniform generation of NP-witnesses using an NP-oracle. INFCTRL: Information and Computation (formerly Information and Control), 163, 2000.
7. M. Bellare and J. Rompel. Randomness-efficient oblivious sampling. In S. Goldwasser, editor, Proceedings: 35th Annual Symposium on Foundations of Computer Science, November 20-22, 1994, Santa Fe, New Mexico, pages 276-287, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, 1994. IEEE Computer Society Press.
8. S. Ben-David, B. Chor, O. Goldreich, and M. Luby. On the theory of average case complexity. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 379-386, 1990.
9. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13(4):850-864, Nov. 1984.
10. N. H. Bshouty, R. Cleve, R. Gavalda, S. Kannan, and C. Tamon. Oracles and queries that are sufficient for exact learning. Journal of Computer and System Sciences, 52(3):421-433, 1996.
11. NP. In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS-01), pages 620-629, 2001.
12. R. Canetti. On BPP and the polynomial-time hierarchy. Information Processing Letters, 57:237-241, 1996.
13. L. Fortnow and A. Klivans. NP with small advice. These proceedings, 2005.
14. O. Goldreich. A sample of samplers - A computational perspective on sampling (survey). In ECCCTR: Electronic Colloquium on Computational Complexity, technical reports, 1997.
15. O. Goldreich. Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Springer-Verlag, Algorithms and Combinatorics, 1998.
16. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal of Computing, 18(1): 186-208, 1989.
17. Y. Han, L. Hemaspaandra, and T. Thierauf. Threshold computation and cryptographic security. SIAM J. Comput., 26(1):59-78, 1997.
18. R. Impagliazzo. Hard-core distributions for somewhat hard problems. In 36th Annual Symposium on Foundations of Computer Science, pages 538-545, Milwaukee, Wisconsin, 23-25 Oct. 1995. IEEE.
19. R. Impagliazzo, R. Shaltiel, and A. Wigderson. Near-optimal conversion of hardness into pseudo-randomness. In IEEE, editor, 40th Annual Symposium on Foundations of Computer Science: October 17-19, 1999, New York City, New York, pages 181-190, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, 1999. IEEE Computer Society Press.
20. R. Impagliazzo, R. Shaltiel, and A. Wigderson. Extractors and pseudo-random generators with optimal seed length. In ACM, editor, Proceedings of the thirty second annual ACM Symposium on Theory of Computing: Portland, Oregon, May 21-23, [2000], pages 1-10, New York, NY, USA, 2000. ACM Press.
21. R. Impagliazzo and A. Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 220-229, El Paso, Texas, 4-6 May 1997.
22. M. R. Jerrum, L. G. Valiant, and V. V. Vazirani. Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science, 43(2-3): 169-188, 1986.
23. V. Kabanets. Derandomization: A brief overview. In ECC-CTR: Electronic Colloquium on Computational Complexity, technical reports, 2002.
24. A. R. Klivans and D. van Melkebeek. Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM Journal on Computing, 31(5):1501-1526, Oct. 2002.
25. P. B. Miltersen and N. V. Vinodchandran. Derandomizing Arthur-Merlin games using hitting sets. In 40th Annual Symposium on Foundations of Computer Science (FOCS '99), pages 71-80, 1999.
26. N. Nisan and A. Wigderson. Hardness vs randomness. Journal of Computer and System Sciences, 49(2): 149-167, Oct. 1994.
27. A. Russell and R. Sundaram. Symmetric alternation captures BPP. Computational Complexity, 7(2):152-162, 1998.
28. R. Shaltiel and C. Umans. Simple extractors for all minentropies and a new pseudo-random generator. In IEEE, editor, 42nd IEEE Symposium on Foundations of Computer Science: proceedings: October 14-17, 2001, Las Vegas, Nevada, USA, pages 648-657, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, 2001. IEEE Computer Society Press.
29. L. Stockmeyer. The complexity of approximate counting. In ACM, editor, Proceedings of the fifteenth annual ACM Symposium on Theory of Computing, Boston, Massachusetts, April 25-27, 1983, pages 118-126, New York, NY, USA, 1983. ACM Press.
30. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR lemma. Journal of Computer and System Sciences, 62:236-266, 2001.
31. C. Umans. Pseudo-random generators for all hardnesses. Journal of Computer and System Sciences, 67:419-440, 2003.
32. L. Welch and E. Berlekamp. Error correction for algebraic block codes. U.S. Patent No. 4,633,470, issued December 30, 1986.
33. A. C. Yao. Theory and applications of trapdoor functions (extended abstract). In 23th Annual Symposium on Foundations of Computer Science (FOCS '82), pages 80-91, Los Alamitos, Ca., USA, Nov. 1982. IEEE Computer Society Press.