@article{Sherstov2008CommunicationLB, title={Communication Lower Bounds Using Dual Polynomials}, author={Alexander A. Sherstov}, journal={Bulletin of the EATCS}, year={2008}, volume={95}, pages={59-93} }

- Published 2008 in Electronic Colloquium on Computational Complexity

Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x1, . . . , xn) that approximates or sign-represents a given Boolean function f (x1, . . . , xn). This article surveys a new and growing body of work in communication complexity that centers around the dual objects, i.e., polynomials that certify the difficulty of approximating or signrepresenting a given function. We provide a… CONTINUE READING

Showing 1-10 of 60 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential