Author:
Canonne Clément L.,Gur Tom
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference41 articles.
1. Scott Aaronson & Avi Wigderson (2008). Algebrization: a new barrier in complexity theory. In Proceedings of STOC, 731–740.
http://doi.acm.org/10.1145/1374376.1374481
2. Alon, Noga, Fischer, Eldar, Krivelevich, Michael, Szegedy, Mario: Efficient Testing of Large Graphs. Combinatorica 20(4), 451–476 (2000).
https://doi.org/10.1007/s004930070001
3. Ben-Sasson, Eli, Goldreich, Oded, Harsha, Prahladh, Sudan, Madhu, Vadhan, Salil P.: Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. SIAM Journal on Computing 36(4), 889–974 (2006).
https://doi.org/10.1137/S0097539705446810
4. Ben-Sasson, Eli, Harsha, Prahladh, Raskhodnikova, Sofya: Some 3CNF Properties Are Hard to Test. SIAM J. Comput. 35(1), 1–21 (2005).
https://doi.org/10.1137/S0097539704445445
5. Arnab Bhattacharyya & Yuichi Yoshida (2017). Property Testing. Forthcoming.
https://propertytestingbook.wordpress.com/
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献