Prefer a chat interface with context about you and your work?
A characterization of locally testable affine-invariant properties via decomposition theorems
Let P be a property of function Fnp → {0, 1} for a fixed prime p. An algorithm is called a tester for P if, given a query access to the input function f, with high probability, it accepts when f satisfies P and rejects when f is "far" from …