The Expressive Power of Voting Polynomials

@inproceedings{Aspnes1991TheEP,
  title={The Expressive Power of Voting Polynomials},
  author={James Aspnes and Richard Beigel and Merrick L. Furst and Steven Rudich},
  booktitle={STOC},
  year={1991}
}
We consider the problem of approximating a Boolean function ~ : {O, 1 }m ~ {O, 1} by an integer polynomial p of degree k. For us, a polynomial p(z) predicts the value of ~(z) if, whenever p(z) ~ O, ~(x) = 1, and whenever p(x) < 0, ~(o) = O. A low-degree polynomial p is a good approximator for .f if it predicts ~ at almost all points. Given a positive integer k, and a Boolean function j, we ask, “how good is the best degree k approximation to j?” We introduce a new lower bound technique which… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Separating the polynomial-time hierarchy by oracles

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) • 1985
View 6 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…