Classical lower bounds for $\mathrm{AC^0}$ circuits proceed bottom-up by simplifying or approximating gates beginning at the input layer. We introduce a complementary top-down model called the Chopping Game, played by adversaries Spoiler and Duplicator on the sets of $0$- and $1$-inputs of a Boolean function. In each round, Spoiler keeps at least a $1/m$-fraction of one side, and Duplicator arbitrarily restricts the other; Spoiler seeks to minimize (and Duplicator to maximize) the number of rounds until some coordinate separates the two remaining sets. Every depth-$d$, fan-in-$m$ circuit induces a $d$-round winning strategy for Spoiler, while Duplicator strategies that survive $d$ rounds formalize top-down lower-bound arguments. Through the Chopping Game and using the polynomial-approximation method, we first obtain the classical lower bound for depth-$d$ $\mathrm{AC^0}$ circuits in a top-down fashion. We then consider a $k$-local variant of the Chopping Game, which relaxes Spoiler's win condition by requiring a separating coordinate within each Hamming ball of radius $k$, rather than a single coordinate globally. We put forward a conjecture that the $d$-round $k$-local Chopping Game for $\mathrm{PARITY}$ requires $m = n^{ω(1)}$ in the regime $d \ll k \ll n$. We prove such a lower bound $m \ge n^{Ω(k^{1/d}/d)}$ when Spoiler is restricted to so-called affine strategies, a class of strategies that achieves the best known upper bounds. Finally, we formulate a version of the $k$-local Chopping Game on $n$-regular graphs of girth $>2k$, and we conjecture a graph-theoretic analogue of ``$\mathrm{PARITY} \notin \mathrm{AC^0}$''.

翻译：暂无翻译