Publisher
Springer Berlin Heidelberg
Reference66 articles.
1. Lecture Notes in Computer Science;N. Alon,2003
2. Lecture Notes in Computer Science;A. Ambainis,1997
3. Arora, S.: Probabilistic checking of proofs and the hardness of approximation problems. PhD thesis, UC Berkeley (1994)
4. 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); Preliminary Version in 33rd FOCS (1992)
5. Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM 45(1), 70–122 (1998); Preliminary Version in 33rd FOCS (1992)
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Good Quantum LDPC Codes with Linear Time Decoders;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. Asymptotically good families of quantum and locally testable classical LDPC codes;Mathematical Problems of Cybernetics;2023
3. Quantum Tanner codes;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
4. c3-Locally Testable Codes from Lossless Expanders;2022 IEEE International Symposium on Information Theory (ISIT);2022-06-26
5. Asymptotically good Quantum and locally testable classical LDPC codes;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09