Testing Low-Degree Polynomials over
暂无分享,去创建一个
[1] Noga Alon,et al. Regular Languages are Testable with a Constant Number of Queries , 2000, SIAM J. Comput..
[2] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[3] Private Communications , 2001 .
[4] Ronitt Rubinfeld,et al. Self-testing/correcting for polynomials and for approximate functions , 1991, STOC '91.
[5] Mihir Bellare,et al. Improved non-approximability results , 1994, STOC '94.
[6] Madhu Sudan,et al. Improved Low-Degree Testing and its Applications , 1997, STOC '97.
[7] Tadao Kasami,et al. New generalizations of the Reed-Muller codes-I: Primitive codes , 1968, IEEE Trans. Inf. Theory.
[8] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[9] László Lovász,et al. Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[10] Carsten Lund,et al. Efficient probabilistic checkable proofs and applications to approximation , 1994, STOC '94.
[11] Madhu Sudan,et al. Some improvements to total degree tests , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.
[12] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.
[13] Eli Ben-Sasson,et al. 3CNF Properties are Hard to Test , 2003, Electron. Colloquium Comput. Complex..
[14] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[15] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[16] Noga Alon,et al. Regular languages are testable with a constant number of queries , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[17] Mihir Bellare,et al. Linearity testing in characteristic two , 1996, IEEE Trans. Inf. Theory.