Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SIAM J. Comput. 25(2), 252–271 (1996)
2. Fischer, E.: The art of uninformed decisions: A primer to property testing. Bulletin of the European Association for Theoretical Computer Science 75 (2001)
3. Goldreich, O.: Combinatorial property testing (a survey). DIMACS Series in Discrete Mathematics and Theoretical Computer Science 43, 45–59 (1999)
4. Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica 32(2), 302–343 (2008)
5. Benjamini, I., Schramm, O., Shapira, A.: Every minor-closed property of sparse graphs is testable. In: Proc. of STOC 2008, pp. 393–402 (2008)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献