Author:
Ben-Sasson Eli,Sudan Madhu
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Alon, N., Kaufman, T., Krivelevich, M., Litsyn, S., Ron, D.: Testing Reed-Muller codes. In: Proc. RANDOM 2003, pp. 188–199 (2003)
2. Arora, S.: Probabilistic checking of proofs and the hardness of approximation problems. PhD thesis, University of California at Berkeley (1994)
3. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of the ACM 45(3), 501–555 (1998)
4. Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM 45(1), 70–122 (1998)
5. Arora, S., Sudan, M.: Improved low-degree testing and its applications. In: Proc. STOC 1997, El Paso, Texas, May 4-6, pp. 485–495 (1997)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Efficient Decoder for a Linear Distance Quantum LDPC Code;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. Good Quantum LDPC Codes with Linear Time Decoders;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs;ACM Transactions on Computation Theory;2017-05-12
4. Short Locally Testable Codes and Proofs;Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation;2011
5. Short Locally Testable Codes and Proofs: A Survey in Two Parts;Property Testing;2010