Author:
Kaufman Tali,Viderman Michael
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Babai, L., Shpilka, A., Stefankovic, D.: Locally testable cyclic codes. In: IEEE (ed.) Proceedings: 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003, Cambridge, Massachusetts, October 11-14, pp. 116–125. IEEE Computer Society Press, Los Alamitos (2003)
2. Lecture Notes in Computer Science;E. Ben-Sasson,2003
3. Ben-Sasson, E., Guruswami, V., Kaufman, T., Sudan, M., Viderman, M.: Locally testable codes require redundant testers. In: IEEE Conference on Computational Complexity, pp. 52–61. IEEE Computer Society, Los Alamitos (2009)
4. Ben-Sasson, E., Harsha, P., Raskhodnikova, S.: Some 3CNF properties are hard to test. SIAM Journal on Computing 35(1), 1–21 (2005)
5. Ben-Sasson, E., Sudan, M.: Simple PCPs with poly-log rate and query complexity. In: STOC, pp. 266–275. ACM, New York (2005)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献