Fetching the paper…
Reading the bibliography…
Let $p$ be a fixed prime.
D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions , J. Symbolic Comput. 9
1990
Earlier work this paper cites.
B. Green, Finite field models in additive combinatorics , Surveys in combinatorics 2005, London Math. Soc. Lecture Note Ser., vol. 327, Cambridge Univ. Press, Cambridge, 2005, pp. 1–27
2005
Earlier work this paper cites.
B. Green, A Szemerédi-type regularity lemma in abelian groups, with applications , Geom. Funct. Anal. 15
2005
Earlier work this paper cites.
D. Král, O. Serra, and L. Vena, A combinatorial proof of the removal lemma for groups , J. Combin. Theory Ser. A 116
2009
Earlier work this paper cites.
A. Bhattacharyya, V. Chen, M. Sudan, and N. Xie, Testing linear-invariant non-linear properties: A short report , Property Testing: Current Research and Surveys (O. Goldreich, ed.), Springer Berlin Heidelberg, Berlin, Heidelberg, 2010, pp. 260–268
2010
Earlier work this paper cites.
A. Bhattacharyya and N. Xie, Lower bounds for testing triangle-freeness in Boolean functions , Comput. Complexity 24
2010
Earlier work this paper cites.
J. Fox, A new proof of the graph removal lemma , Ann. of Math. (2) 174
2011
Earlier work this paper cites.
R. Rubinfeld and A. Shapira, Sublinear time algorithms , SIAM J. Discrete Math. 25
2011
Cited alongside, same era.
A. Bhattacharyya, E. Grigorescu, P. Raghavendra, and A. Shapira, Testing odd-cycle-freeness in Boolean functions , Combin. Probab. Comput. 21
2012
Cited alongside, same era.
A. Bhattacharyya, Guest column: On testing affine-invariant properties over finite fields , ACM SIGACT News 44
2013
Cited alongside, same era.
H. Fu and R. Kleinberg, Improved lower bounds for testing triangle-freeness in Boolean functions via fast matrix multiplication , Approximation, randomization, and combinatorial optimization, LIPIcs. Leibniz Int. Proc. Inform., vol. 28, Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2014, pp. 669–676
2014
Cited alongside, same era.
A. Bhattacharyya, E. Grigorescu, and A. Shapira, A unified framework for testing linear-invariant properties , Random Structures Algorithms 46
2016
Closest in time.
2016
Closest in time.
L. Pebody, Proof of a Conjecture of Kleinberg-Sawin-Speyer , preprint at arXiv:1608.05740, 2016
2016
Closest in time.
2016
Closest in time.
J. Blasiak, T. Church, H. Cohn, J. A. Grochow, E. Naslund, W. F. Sawin, and C. Umans, On cap sets and the group-theoretic approach to matrix multiplication , Discrete Analysis 2017:3
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
I. Haviv and N. Xie, Sunflowers and testing triangle-freeness of functions , ITCS’15—Proceedings of the 6th Innovations in Theoretical Computer Science, ACM, New York, 2015, pp. 357–366
2015
Cited alongside, same era.
P. Hatami, S. Sachdeva, and M. Tulsiani, An arithmetic analogue of Fox’s triangle removal argument , Online J. Anal. Comb. (2016), Art. 1, 17
2016
Cited alongside, same era.
2017
Closest in time.
E. Croot, V. F. Lev, and P. P. Pach, Progression-free sets in ℤ 4 n \mathbb{Z}^{n}_{4} are exponentially small , Ann. of Math. (2) 185
2017
Closest in time.
J. S. Ellenberg and D. Gijswijt, On large subsets of 𝔽 q n \mathbb{F}^{n}_{q} with no three-term arithmetic progression , Ann. of Math. (2) 185
2017
Closest in time.