Key points are not available for this paper at this time.
We define tests of boolean functions which distinguish between linear (or quadratic) polynomials, and functions which are very far, in an appropriate sense, from these polynomials. The tests have optimal or nearly optimal trade-offs between soundness and the number of queries.
Alex Samorodnitsky (Mon,) studied this question.