Abstract
$ \newcommand{\collision}{\textsf{Collision}} \newcommand{\elementdistinctness}{\textsf{Element Distinctness}} $ 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 error $1/3$ in the $\ell_\infty$ norm. In an influential result, Aaronson and Shi (J. ACM, 2004) proved tight $\widetilde{\Omega}(n^{1/3})$ and $\widetilde{\Omega}(n^{2/3})$ lower bounds on the approximate degree of the $\collision$ and $\elementdistinctness$ functions, respectively. Their proof was non-constructive, using a sophisticated symmetrization argument and tools from approximation theory. More recently, several open problems in the study of approximate degree have been resolved via the construction of dual polynomials. These are explicit dual solutions to an appropriate linear program that captures the approximate degree of any function. We reprove Aaronson and Shi's results by constructing explicit dual polynomials for the $\collision$ and $\elementdistinctness$ functions. Our constructions are heavily inspired by Kutin's (Theory of Computing, 2005) refinement and simplification of Aaronson and Shi's results.
Highlights
The ε-approximate degree of a Boolean function f : {−1, 1}n → {−1, 1} is the least degree of a real polynomial that approximates f to within error ε in the ∞ norm
The lower bound for ELEMENT DISTINCTNESS follows from a reduction to the lower bound for COLLISION
The function F is obtained by block-composing the ELEMENT DISTINCTNESS function with a certain constant-depth Boolean formula, and Sherstov’s proof is via the method of dual polynomials
Summary
The ε-approximate degree of a Boolean function f : {−1, 1}n → {−1, 1} is the least degree of a real polynomial that approximates f to within error ε in the ∞ norm. Aaronson and Shi proved tight Ω(n1/3) and Ω(n2/3) lower bounds on the approximate degree of the COLLISION and ELEMENT DISTINCTNESS functions [5].1. The Ω(n2/3) lower bound for ELEMENT DISTINCTNESS remains the best known approximate degree lower bound for any function in AC0. Aaronson and Shi proved their lower bound for COLLISION with a symmetrization argument. This style of argument proceeds in two steps. The lower bound for ELEMENT DISTINCTNESS follows from a reduction to the lower bound for COLLISION.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have