A Dual Polynomial for OR

Details A Dual Polynomial for OR A Dual Polynomial for OR

2008-03-31

arxiv.org/abs/0803.4516v1

Computer Science

Computational Complexity

6 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Dual Polynomial for OR does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Dual Polynomial for OR, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Dual Polynomial for OR will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-198048