Author:
Alon Noga,Kaufman Tali,Krivelevich Michael,Litsyn Simon,Ron Dana
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Alon, N., Krivelevich, M., Newman, I., Szegedy, M.: Regular languages are testable with a constant number of queries. In: Proceedings of the Fortieth Annual Symposium on Foundations of Computer Science, pp. 645–655 (1999)
2. Arora, S., Safra, S.: Improved low-degree testing and its applications. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, pp. 485–495 (1997)
3. Babai, L., Fortnow, L., Levin, L., Szegedy, M.: Checking computations in polylogarithmic time. In: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, pp. 21–31 (1991)
4. Babai, L., Fortnow, L., Lund, C.: Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity 1(1), 3–40 (1991)
5. Bellare, M., Coppersmith, D., Håstad, J., Kiwi, M., Sudan, M.: Linearity testing in characteristic two. In: Proceedings of the Thirty-Sixth Annual Symposium on Foundations of Computer Science, pp. 432–441 (1995)
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献