Optimal Testing of Reed-Muller Codes
暂无分享,去创建一个
[1] Ben Green,et al. The distribution of polynomials over finite fields, with applications to the Gowers norms , 2007, Contributions Discret. Math..
[2] Shachar Lovett,et al. Inverse conjecture for the gowers norm is false , 2007, Theory Comput..
[3] Brendan D. McKay,et al. On determinants of random symmetric matrices over Z_m , 2010, 1004.5440.
[4] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[5] Atri Rudra,et al. Testing Low-Degree Polynomials over Prime Fields , 2004, FOCS.
[6] Ben Green,et al. AN INVERSE THEOREM FOR THE GOWERS U4-NORM , 2005, Glasgow Mathematical Journal.
[7] Emanuele Viola,et al. The Sum of D Small-Bias Generators Fools Polynomials of Degree D , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.
[8] Luca Trevisan,et al. Gowers uniformity, influence of variables, and PCPs , 2005, STOC '06.
[9] Terence Tao,et al. The inverse conjecture for the Gowers norm over finite fields via the correspondence principle , 2008, 0810.5527.
[10] Oded Goldreich,et al. Hierarchy Theorems for Property Testing , 2009, APPROX-RANDOM.
[11] Venkatesan Guruswami,et al. Tolerant Locally Testable Codes , 2005, APPROX-RANDOM.
[12] Terence Tao,et al. An Inverse Theorem for the Uniformity Seminorms Associated with the Action of F , 2010 .
[13] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 1992, computational complexity.
[14] W. T. Gowers,et al. A New Proof of Szemerédi's Theorem for Arithmetic Progressions of Length Four , 1998 .
[15] Emanuele Viola,et al. Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).
[16] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[17] Amit Kumar,et al. Minimizing Average Flow-time : Upper and Lower Bounds , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[18] Shannon R. Lockard,et al. TRIVIAL SELMER GROUPS AND EVEN PARTITIONS OF A GRAPH , 2004 .
[19] Carsten Lund,et al. Nondeterministic exponential time has two-prover interactive protocols , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[20] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[21] Ben Green,et al. AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM , 2008, Proceedings of the Edinburgh Mathematical Society.
[22] Madhu Sudan,et al. Optimal Testing of Reed-Muller Codes , 2009, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[23] Noga Alon,et al. Testing Reed-Muller codes , 2005, IEEE Transactions on Information Theory.
[24] Mihir Bellare,et al. Linearity testing in characteristic two , 1996, IEEE Trans. Inf. Theory.
[25] W. T. Gowers,et al. A new proof of Szemerédi's theorem , 2001 .
[26] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[27] Madhu Sudan,et al. Algebraic property testing: the role of invariance , 2008, Electron. Colloquium Comput. Complex..
[28] Dana Ron,et al. Testing Polynomials over General Fields , 2006, SIAM J. Comput..
[29] Ben Green,et al. An inverse theorem for the Gowers U^{s+1}[N]-norm (announcement) , 2010, 1009.3998.
[30] Shachar Lovett. Unconditional Pseudorandom Generators for Low Degree Polynomials , 2009, Theory Comput..
[31] László Lovász,et al. Interactive proofs and the hardness of approximating cliques , 1996, JACM.
[32] Emanuele Viola,et al. Pseudorandom Bits for Polynomials , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[33] Noga Alon,et al. Lower bounds for approximations by low degree polynomials over Z/sub m/ , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.
[34] Ronitt Rubinfeld,et al. Tolerant property testing and distance approximation , 2006, J. Comput. Syst. Sci..
[35] T. Tao,et al. The primes contain arbitrarily long arithmetic progressions , 2004, math/0404188.