Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication

Hu Fu, Robert Kleinberg, Marc Herbstritt
2014 International Workshop on Approximation Algorithms for Combinatorial Optimization  
Understanding the query complexity for testing linear-invariant properties has been a central open problem in the study of algebraic property testing. Triangle-freeness in Boolean functions is a simple property whose testing complexity is unknown.
doi:10.4230/lipics.approx-random.2014.669 dblp:conf/approx/FuK14 fatcat:ecmrth5wlrd4lfawhzc6ahjmee