近似度的对偶下界与Markov-Bernstein不等式
Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities
摘要:
布尔函数$f: \{-1, 1\}^n \to \{-1, 1\}$的$ε$ -近似次数是在$\ell_\infty$范数下将$f$近似到$ε$内的实多项式的最小次数。我们证明了这一重要的复杂性措施明确构建一个适当的线性规划的对偶解决方案的几个下界。我们的第一个结果解决了任何常数$ε> 0$的两级AND-OR树的$ε$ -近似度。我们表明,这个数量是$Θ(\sqrt{n})$,关闭一条线的递增较大的下限。同样的下限最近由Sherstov使用相关技术独立获得。我们的第二个结果给出了一个显式的对偶多项式,证明了任何对称布尔函数的近似度的严格下界,解决了Špalek的问题。我们的最后一个贡献是通过构造自然线性规划的显式对偶解,从逼近理论的角度重新证明了几个马尔可夫型不等式。这些不等式是许多最著名的近似度下界的证明基础,在整个理论计算机科学中有重要的用途。
英文摘要:
The $ε$-approximate degree of a Boolean function $f: \{-1, 1\}^n \to \{-1, 1\}$ is the minimum degree of a real polynomial that approximates $f$ to within $ε$ in the $\ell_\infty$ norm. We prove several lower bounds on this important complexity measure by explicitly constructing solutions to the dual of an appropriate linear program. Our first result resolves the $ε$-approximate degree of the two-level AND-OR tree for any constant $ε> 0$. We show that this quantity is $Θ(\sqrt{n})$, closing a line of incrementally larger lower bounds. The same lower bound was recently obtained independently by Sherstov using related techniques. Our second result gives an explicit dual polynomial that witnesses a tight lower bound for the approximate degree of any symmetric Boolean function, addressing a question of Špalek. Our final contribution is to reprove several Markov-type inequalities from approximation theory by constructing explicit dual solutions to natural linear programs. These inequalities underly the proofs of many of the best-known approximate degree lower bounds, and have important uses throughout theoretical computer science.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。