Better lossless condensers through derandomized curve samplers

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 177-186

  Ta Shma, Amnon ^a   Umans, Christopher ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOSSLESS CONDENSERS; MIN-ENTROPY; UNBALANCED EXPANDER;

FUNCTION EVALUATION; PROBLEM SOLVING; RANDOM PROCESSES;

GRAPH THEORY;

EID: 38749136246     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.18     Document Type: Conference Paper

References (21)

1. M. Bellare and J. Rompel. Randomness-efficient oblivious sampling. In FOCS, pages 276-287, 1994.
2. E. Ben-Sasson, M. Sudan, S. Vadhan, and A. Wigderson. Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. In STOC, pages 612-621, 2003.
3. M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson. Randomness conductors and constant-degree expansion beyond the degree/2 barrier. In STOC, pages 659-668, 2002.
4. R. Impagliazzo, R. Shaltiel, and A. Wigderson. Extractors and pseudo-random generators with optimal seed length. In STOC, pages 1-10, 2000.
5. C.-J. Lu, O. Reingold, S. Vadhan, and A. Wigderson. Extractors: Optimal up to constant factors. In STOC, pages 602-611, 2003.
6. D. Moshkovitz and R. Raz. Sub-constant error low degree test of almost linear size. In STOC, 2006.
7. N. Nisan and D. Zuckerman. Randomness is linear in space. Journal of Computer and System Sciences, 52(1):43-52, 1996.
8. R. Raz and O. Reingold. On recycling the randomness of states in space bounded computation. In STOC, pages 159-168, 1999.
9. O. Reingold, R. Shaltiel, and A. Wigderson. Extracting randomness via repeated condensing. In FOCS, pages 22-31, 2000.
10. R. Shaltiel and C. Umans. Pseudorandomness for approximate counting and sampling. In Computational Complexity, pages 212-226, 2005.
11. R. Shaltiel and C. Umans. Simple extractors for all minentropies and a new pseudorandom generator. Journal of the ACM, 52(2): 172-216, 2005.
12. M. Sipser and D. A. Spielman. Expander codes. IEEE Transactions on Information Theory, 42(6): 1710-1722, 1996.
13. A. Srinivasan and D. Zuckerman. Computing with very weak random sources. SIAM Journal on Computing, 28:1433-1459, 1999.
14. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the xor lemma. Journal of Computer and System Sciences, 62(2):236-266, 2001.
15. A. Ta-Shma. On extracting randomness from weak random sources. In STOC, pages 276-285, 1996.
16. A. Ta-Shma, C. Umans, and D. Zuckerman. Loss-less condensers, unbalanced expanders, and extractors. In STOC, pages 143-152, 2001.
17. A. Ta-Shma, D. Zuckerman, and S. Safra. Extractors from Reed-Muller codes. Journal of Computer and System Sciences, 72(5):786-812, 2006.
18. L. Trevisan. Extractors and pseudorandom generators. Journal of the ACM, pages 860-879, 2001.
19. C. Umans. Pseudo-random generators for all hardnesses. Journal of Computer and System Sciences, 67(2):419-440, 2003.
20. C. Umans. Reconstructive dispersers and hitting set generators. In RANDOM, pages 460-471, 2005.
21. D. Zuckerman. Personal communication, June 2006.