Hitting Sets for Low-Degree Polynomials with Optimal Density
暂无分享,去创建一个
[1] D. V. Chudnovsky,et al. Algebraic complexities and algebraic curves over finite fields , 1987, J. Complex..
[2] Zeev Dvir,et al. Noisy Interpolating Sets for Low Degree Polynomials , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.
[3] Amnon Ta-Shma,et al. Pseudorandom Generators for Low Degree Polynomials from Algebraic Geometry Codes , 2013, Electron. Colloquium Comput. Complex..
[4] Ignacio Cascudo,et al. Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field , 2009, CRYPTO.
[5] Emanuele Viola. The Sum of d Small-Bias Generators Fools Polynomials of Degree d , 2008, Computational Complexity Conference.
[6] I. Shparlinski,et al. Curves with many points and multiplication in finite fileds , 1992 .
[7] Noga Alon,et al. Simple construction of almost k-wise independent random variables , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[8] Andrej Bogdanov. Pseudorandom generators for low degree polynomials , 2005, STOC '05.
[9] Shachar Lovett,et al. Unconditional pseudorandom generators for low degree polynomials , 2008, Theory Comput..
[10] Chi-Jen Lu. Hitting Set Generators for Sparse Polynomials over Any Finite Fields , 2012, 2012 IEEE 27th Conference on Computational Complexity.
[11] Henning Stichtenoth,et al. Algebraic function fields and codes , 1993, Universitext.
[12] Emanuele Viola,et al. Pseudorandom Bits for Polynomials , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[13] Luca Trevisan,et al. Some Applications of Coding Theory in Computational Complexity , 2004, Electron. Colloquium Comput. Complex..
[14] Ivan Damgård,et al. On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations , 2012, ICITS.
[15] Moni Naor,et al. Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.
[16] H. Stichtenoth,et al. A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound , 1995 .
[17] Zeev Dvir,et al. Noisy Interpolating Sets for Low Degree Polynomials , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.
[18] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[19] Avi Wigderson,et al. Deterministic approximate counting of depth-2 circuits , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.
[20] Venkatesan Guruswami,et al. List decoding algorithms for certain concatenated codes , 2000, STOC '00.
[21] Noga Alon,et al. Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.
[22] Nader H. Bshouty,et al. Testers and their applications , 2014, ITCS.