Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities

Abstract

The ε-approximate degree of a Boolean function f: { − 1, 1}ⁿ → { − 1, 1} is the minimum degree of a real polynomial that approximates f to within ε in the ℓ_∞ 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 $\Theta(\sqrt{n})$, closing a line of incrementally larger lower bounds [3,11,21,30,32]. The same lower bound was recently obtained independently by Sherstov using related techniques [25]. 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 [34]. 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.

The full version of this paper is available at http://arxiv.org/abs/1302.6191