A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication
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