Author:
Fox Jacob,Tidor Jonathan,Zhao Yufei
Publisher
Springer Science and Business Media LLC
Reference27 articles.
1. N. Alon, R. A. Duke, H. Lefmann, V. Rödl and R. Yuster, The algorithmic aspects of the regularity lemma, Journal of Algorithms 16 (1994), 80–109.
2. N. Alon, E. Fischer, M. Krivelevich and M. Szegedy, Efficient testing of large graphs, Combinatorica 20 (2000), 451–476.
3. N. Alon and A. Shapira, A characterization of the (natural) graph properties testable with one-sided error, SIAM Journal on Computing 37 (2008), 1703–1727.
4. A. Bhattacharyya, E. Fischer, H. Hatami, P. Hatami and S. Lovett, Every locally characterized affine-invariant property is testable, in STOC’13—Proceedings of the 2013 ACM Symposium on Theory of Computing, ACM, New York, 2013, pp. 429–435.
5. A. Bhattacharyya, E. Grigorescu and A. Shapira, A unified framework for testing linear-invariant properties, Random Structures & Algorithms 46 (2015), 232–260.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Testing Linear-Invariant Properties;SIAM Journal on Computing;2022-07-21