Low-degree tests at large distances (2007)
| Venue: | In Proceedings of the 39th Annual ACM Symposium on Theory of Computing |
| Citations: | 27 - 1 self |
BibTeX
@INPROCEEDINGS{Samorodnitsky07low-degreetests,
author = {Alex Samorodnitsky},
title = {Low-degree tests at large distances},
booktitle = {In Proceedings of the 39th Annual ACM Symposium on Theory of Computing},
year = {2007},
pages = {506--515}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract 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 thenumber of queries. In particular, we show that functions with small Gowers uniformity norms behave "ran-domly " with respect to hypergraph linearity tests. A central step in our analysis of quadraticity tests is the proof of an inverse theorem forthe third Gowers uniformity norm of boolean functions. The last result has also a coding theory application. It is possible to estimate efficientlythe distance from the second-order Reed-Muller code on inputs lying far beyond its listdecoding radius.
