Towards Optimal Depth Reductions for Syntactically Multilinear Circuits

We show that any $n$-variate polynomial computable by a syntactically multilinear circuit of size $\operatorname{poly}(n)$ can be computed by a depth-$4$ syntactically multilinear ($ΣΠΣΠ$) circuit of size at most $\exp\left({O\left(\sqrt{n\log n}\right)}\right)$. For degree $d = ω(n/\log n)$, this improves upon the upper bound of $\exp\left({O(\sqrt{d}\log n)}\right)$ obtained by Tavenas~\cite{T15} for general circuits, and is known to be asymptotically optimal in the exponent when $d < n^ε$ for a small enough constant $ε$. Our upper bound matches the lower bound of $\exp\left({Ω\left(\sqrt{n\log n}\right)}\right)$ proved by Raz and Yehudayoff~\cite{RY09}, and thus cannot be improved further in the exponent. Our results hold over all fields and also generalize to circuits of small individual degree. More generally, we show that an $n$-variate polynomial computable by a syntactically multilinear circuit of size $\operatorname{poly}(n)$ can be computed by a syntactically multilinear circuit of product-depth $Δ$ of size at most $\exp\left(O\left(Δ\cdot (n/\log n)^{1/Δ} \cdot \log n\right)\right)$. It follows from the lower bounds of Raz and Yehudayoff (CC 2009) that in general, for constant $Δ$, the exponent in this upper bound is tight and cannot be improved to $o\left(\left(n/\log n\right)^{1/Δ}\cdot \log n\right)$.

Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.