Extractors and condensers from univariate polynomials
暂无分享,去创建一个
[1] Michael Sipser,et al. Expanders, Randomness, or Time versus Space , 1988, Journal of computer and system sciences (Print).
[2] David Zuckerman,et al. On Unapproximable Versions of NP-Complete Problems , 1996, SIAM J. Comput..
[3] Oded Goldreich,et al. Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing (Preliminary Version) , 1997, STOC 1994.
[4] Christopher Umans,et al. On Obtaining Pseudorandomness from Error-Correcting Codes , 2006, FSTTCS.
[5] Avi Wigderson,et al. Extractors and pseudo-random generators with optimal seed length , 2000, STOC '00.
[6] Amnon Ta-Shma,et al. Better lossless condensers through derandomized curve samplers , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[7] Michael Sipser,et al. Expanders, Randomness, or Time versus Space , 1988, J. Comput. Syst. Sci..
[8] Noam Nisan,et al. Hardness vs Randomness , 1994, J. Comput. Syst. Sci..
[9] Avi Wigderson,et al. Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications , 1999, Comb..
[10] David Zuckerman. Simulating BPP using a general weak random source , 2005, Algorithmica.
[11] Venkatesan Guruswami,et al. Explicit capacity-achieving list-decodable codes , 2005, STOC.
[12] Christopher Umans,et al. Hardness of approximating /spl Sigma//sub 2//sup p/ minimization problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[13] Avi Wigderson,et al. Tiny Families of Functions with Random Properties: A Quality-Size Trade-off for Hashing , 1997, Electron. Colloquium Comput. Complex..
[14] Ronen Shaltiel,et al. Recent Developments in Explicit Constructions of Extractors , 2002, Bull. EATCS.
[15] Alexander Russell,et al. Perfect Information Leader Election in log* n+O (1) Rounds , 2001, J. Comput. Syst. Sci..
[16] Venkatesan Guruswami,et al. Combinatorial bounds for list decoding , 2002, IEEE Trans. Inf. Theory.
[17] Amnon Ta-Shma,et al. Loss-less condensers, unbalanced expanders, and extractors , 2001, STOC '01.
[18] David Zuckerman,et al. Randomness-optimal oblivious sampling , 1997, Random Struct. Algorithms.
[19] Amnon Ta-Shma,et al. Extractor codes , 2001, IEEE Transactions on Information Theory.
[20] V. Shoup. New algorithms for finding irreducible polynomials over finite fields , 1990 .
[21] Aravind Srinivasan,et al. Computing with very weak random sources , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[22] Noam Nisan,et al. Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..
[23] Christopher Umans,et al. Simple extractors for all min-entropies and a new pseudorandom generator , 2005, JACM.
[24] Venkatesan Guruswami. Better extractors for better codes? , 2004, STOC '04.
[25] Avi Wigderson,et al. Extracting randomness via repeated condensing , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[26] Oded Goldreich,et al. Another proof that BPP subseteq PH (and more) , 1997, Electron. Colloquium Comput. Complex..
[27] Russell Impagliazzo,et al. How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.
[28] Venkatesan Guruswami,et al. Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.
[29] Luca Trevisan,et al. Extractors and pseudorandom generators , 2001, JACM.
[30] A. Wigderson,et al. Disperser graphs, deterministic amplification, and imperfect random sources (גרפים מפזרים, הגברה דטרמיניסטית ומקורות אקראים חלשים.) , 1991 .
[31] Madhu Sudan,et al. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..
[32] Elchanan Mossel,et al. On the complexity of approximating the VC dimension , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.
[33] Omer Reingold,et al. Randomness Conductors and Constant-Degree Expansion Beyond the Degree / 2 Barrier , 2001 .
[34] Avi Wigderson,et al. Extractors: optimal up to constant factors , 2003, STOC '03.
[35] L. Fortnow. Recent Developments in Explicit Constructions of Extractors , 2002 .
[36] Amnon Ta-Shma,et al. Extractors from Reed-Muller Codes , 2001, Electron. Colloquium Comput. Complex..
[37] Harald Niederreiter,et al. Introduction to finite fields and their applications: List of Symbols , 1986 .
[38] C. Umans. Hardness of Approximating p 2 Minimization Problems , 1999 .
[39] Alexander Vardy,et al. Correcting errors beyond the Guruswami-Sudan radius in polynomial time , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[40] Ran Raz,et al. On recycling the randomness of states in space bounded computation , 1999, STOC '99.
[41] Elchanan Mossel,et al. On the complexity of approximating the VC dimension , 2002, J. Comput. Syst. Sci..
[42] David Zuckerman,et al. Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .
[43] Ran Raz,et al. Extractors with weak random seeds , 2005, STOC '05.