A Dual Polynomial for OR

We reprove that the approximate degree of the OR function on n bits is Omega(sqrt(n)). We consider a linear program which is feasible if and only if there is an approximate polynomial for a given function, and apply the duality theory. The duality theory says that the primal program has no solution if and only if its dual has a solution. Therefore one can prove the nonexistence of an approximate polynomial by exhibiting a dual solution, coined the dual polynomial. We construct such a polynomial.

[1]  A. S.  The Pattern Matrix Method for Lower Bounds on Quantum Communication ∗ , 2007 .

[2]  Noam Nisan,et al.  On the degree of boolean functions as real polynomials , 2005, computational complexity.

[3]  Ronald de Wolf,et al.  Quantum Search on Bounded-Error Inputs , 2003, ICALP.

[4]  Yaoyun Shi,et al.  Quantum communication complexity of block-composed functions , 2007, Quantum Inf. Comput..

[5]  Scott Aaronson,et al.  Quantum lower bounds for the collision and the element distinctness problems , 2004, JACM.

[6]  Arkadev Chattopadhyay,et al.  Multiparty Communication Complexity of Disjointness , 2008, Electron. Colloquium Comput. Complex..

[7]  Richard Beigel,et al.  The polynomial method in circuit complexity , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[8]  Ronald de Wolf,et al.  Quantum lower bounds by polynomials , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[9]  Ramamohan Paturi,et al.  On the degree of polynomials that approximate symmetric Boolean functions (preliminary version) , 1992, STOC '92.

[10]  Troy Lee,et al.  Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model , 2008, Computational Complexity Conference.