Random Low Degree Polynomials are Hard to Approximate
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
On the structure of cubic and quartic polynomials
Proceedings of the forty-second ACM symposium on Theory of computing
Holes in generalized Reed-Muller codes
IEEE Transactions on Information Theory
Correlation testing for affine invariant properties on Fpn in the high error regime
Proceedings of the forty-third annual ACM symposium on Theory of computing
| Hi-index | 0.06 |
A degree-d polynomial p in n variables over a field F isequidistributed if it takes on each of its F values closeto equally often, and biased otherwise. We say that p haslow rank if it can be expressed as a function of a smallnumber of lower degree polynomials. Green and Tao [GT07] have shown that over large fields (i.e when d