arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0803.4516cs.CC
收藏

关于OR的一个对偶多项式

A Dual Polynomial for OR

Robert Spalek

摘要:

重新证明了n位OR函数的逼近阶为Omega(sqrt(n)).本文考虑一个线性规划是可行的当且仅当给定函数存在一个近似多项式,并应用对偶理论。对偶理论认为原始规划无解当且仅当其对偶有解。因此,人们可以证明一个近似多项式的不存在性,通过展示一个对偶解决方案,创造了对偶多项式。我们构造这样一个多项式。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑