Noncommutative Valiant's Classes: Structure and Complete Problems (1508.00395v1)

Abstract: In this paper we explore the noncommutative analogues, $\mathrm{VP}{nc}$ and $\mathrm{VNP}{nc}$, of Valiant's algebraic complexity classes and show some striking connections to classical formal language theory. Our main results are the following: (1) We show that Dyck polynomials (defined from the Dyck languages of formal language theory) are complete for the class $\mathrm{VP}{nc}$ under $\le{abp}$ reductions. Likewise, it turns out that $\mathrm{PAL}$ (Palindrome polynomials defined from palindromes) are complete for the class $\mathrm{VSKEW}{nc}$ (defined by polynomial-size skew circuits) under $\le{abp}$ reductions. The proof of these results is by suitably adapting the classical Chomsky-Sch\"{u}tzenberger theorem showing that Dyck languages are the hardest CFLs. (2) Next, we consider the class $\mathrm{VNP}{nc}$. It is known~\cite{HWY10a} that, assuming the sum-of-squares conjecture, the noncommutative polynomial $\sum{w\in{x_0,x_1}^n}ww$ requires exponential size circuits. We unconditionally show that $\sum_{w\in{x_0,x_1}^n}ww$ is not $\mathrm{VNP}{nc}$-complete under the projection reducibility. As a consequence, assuming the sum-of-squares conjecture, we exhibit a strictly infinite hierarchy of p-families under projections inside $\mathrm{VNP}{nc}$ (analogous to Ladner's theorem~\cite{Ladner75}). In the final section we discuss some new $\mathrm{VNP}{nc}$-complete problems under $\le{abp}$-reductions. (3) Inside $\mathrm{VP}{nc}$ too we show there is a strict hierarchy of p-families (based on the nesting depth of Dyck polynomials) under the $\le{abp}$ reducibility.