Linearity testing in characteristic two
暂无分享,去创建一个
[1] Daniel A. Spielman,et al. Nearly-linear size holographic proofs , 1994, STOC '94.
[2] Madhu Sudan,et al. Some improvements to total degree tests , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.
[3] Mihir Bellare,et al. Improved non-approximability results , 1994, STOC '94.
[4] Johan Håstad. Testing of the long code and hardness for clique , 1996, STOC '96.
[5] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[6] Leonid A. Levin,et al. Checking computations in polylogarithmic time , 1991, STOC '91.
[7] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.
[8] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[9] N. S. Barnett,et al. Private communication , 1969 .
[10] M. Sudan,et al. Robust Characterizations of Polynomials and Their Applications to Program Testing , 1993 .
[11] Marcos A. Kiwi,et al. Probabilistically checkable proofs and the testing of hadamard-like codes , 1996 .
[12] László Lovász,et al. Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[13] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[14] Carsten Lund,et al. Proof verification and the intractability of approximation problems , 1992, FOCS 1992.
[15] Carsten Lund,et al. Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.
[16] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[17] M. Bellare,et al. Efficient probabilistic checkable proofs and applications to approximation , 1994, STOC '94.
[18] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.
[19] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[20] Ronitt Rubinfeld,et al. Self-testing/correcting for polynomials and for approximate functions , 1991, STOC '91.