暂无分享,去创建一个
[1] Irving S. Reed,et al. A class of multiple-error-correcting codes and the decoding scheme , 1954, Trans. IRE Prof. Group Inf. Theory.
[2] Manuel Blum,et al. Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time , 1980, Inf. Process. Lett..
[3] Ryan O'Donnell,et al. Analysis of Boolean Functions , 2014, ArXiv.
[4] Adi Shamir,et al. How to share a secret , 1979, CACM.
[5] Alexander A. Razborov,et al. On the method of approximations , 1989, STOC '89.
[6] A. Bonami. Étude des coefficients de Fourier des fonctions de $L^p(G)$ , 1970 .
[7] Avi Wigderson,et al. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) , 1988, STOC.
[8] Carsten Lund,et al. Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[9] Oded Goldreich,et al. Locally testable codes and PCPs of almost-linear length , 2006, JACM.
[10] Testing low-degree polynomials over prime fields , 2009 .
[11] Richard J. Lipton,et al. New Directions In Testing , 1989, Distributed Computing And Cryptography.
[12] Jonathan Katz,et al. On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.
[13] Joan Feigenbaum,et al. Hiding Instances in Multioracle Queries , 1990, STACS.
[14] Alessandro Panconesi,et al. Concentration of Measure for the Analysis of Randomized Algorithms , 2009 .
[15] Yury Polyanskiy. Hypercontractivity of spherical averages in Hamming space , 2019, SIAM J. Discret. Math..
[16] Richard J. Lipton,et al. A Probabilistic Remark on Algebraic Program Testing , 1978, Inf. Process. Lett..
[17] LundCarsten,et al. Algebraic methods for interactive proof systems , 1992 .
[18] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[19] David E. Muller,et al. Application of Boolean algebra to switching circuit design and to error detection , 1954, Trans. I R E Prof. Group Electron. Comput..
[20] Swastik Kopparty,et al. Decoding Reed-Muller Codes over Product Sets , 2015, Theory Comput..
[21] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[22] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[23] Atri Rudra,et al. Testing low-degree polynomials over prime fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[24] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[25] Eli Ben-Sasson,et al. Some 3CNF properties are hard to test , 2003, STOC '03.
[26] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[27] Madhu Sudan,et al. Algebraic property testing: the role of invariance , 2008, Electron. Colloquium Comput. Complex..
[28] Madhu Sudan,et al. Optimal Testing of Reed-Muller Codes , 2009, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[29] Noga Alon,et al. Testing Reed-Muller codes , 2005, IEEE Transactions on Information Theory.
[30] Dana Ron,et al. Testing polynomials over general fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[31] Vijay V. Vazirani,et al. Matching is as easy as matrix inversion , 1987, STOC.
[32] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.