VW_nb^0[P]: Parameterized Algebraic Complexity

• VW_nb^0[P] is a parameterized algebraic complexity class defined by summing the outputs of constant-free, unbounded-degree algebraic circuits over 0–1 vectors of fixed Hamming weight.
• Under the Shub–Smale τ-conjecture, explicit families in VW_nb^0[P] require exponential circuit sizes, establishing strong fixed-parameter tractable lower bounds.
• The class connects parameterized circuit complexity with the linear counting hierarchy and graph-theoretic characterizations, prompting further study of its relation to VW[F] and potential hierarchy collapses.

The parameterized algebraic complexity class VW$_{nb}^0$[P] is a class of parameterized polynomial families characterized by bounded sums of constant-free, unbounded-degree algebraic circuits, where the sum is over all $0$–$1$ vectors of fixed Hamming weight, and only the constants $\pm1$ are freely available. This class captures a parameterized analog of algebraic exponential sums, and serves as a key object for investigating exponential lower bounds in algebraic circuit complexity, particularly under the Shub–Smale $\tau$-conjecture. Its properties have far-reaching implications for circuit lower bounds, the structure of the linear counting hierarchy, and connections to algebraic formula classes such as VW[F] that are characterized via restricted permanents on “nice” families of graphs (Bhattacharjee et al., 1 Jan 2026).

1. Formal Definition of VW$_{nb}^0$[P]

VW$_{nb}^0$[P] consists of parameterized families of polynomials

$F = (F_{m,k}(X))_{m,k}$

where:

• $X = (X_1,\dots,X_n)$ is a tuple of variables with $n = n(m)$ bounded polynomially in $m$,
• $k$ is the parameter,
• there is a polynomially bounded function $q(m) = m^{O(1)}$ and, for each $m$, a family of constant-free algebraic circuits $G_m(X,Y)$ of size $\tau(G_m) \leq f(k)\cdot q(m)$ for some computable function $f$, with unbounded formal degree,
• for each $m,k$,

$$F_{m,k}(X) = \sum_{y \in \{0,1\}^{q(m)},\,\mathrm{wt}(y) = k} G_m(X, y),$$

where $\mathrm{wt}(y)$ denotes the Hamming weight of $y$.

Equivalently, the sum may be taken over all $e \in \binom{q(m)}{k}$, with each $G_m$ using only the constants $+1$ and $-1$ at no cost.

This class thus encodes parameterized polynomial families generated by weighted sums over restricted supports (fixed Hamming weight) of constant-free, possibly high-degree algebraic circuits.

2. Exponential fpt Lower Bounds under the $\tau$-Conjecture

The main lower bound for VW$_{nb}^0$[P], conditional on the Shub–Smale $\tau$-conjecture, asserts that explicit families in VW$_{nb}^0$[P] require exponential size in their underlying constant-free algebraic circuits with unbounded degree.

The key theorem (Theorem 5.14 in (Bhattacharjee et al., 1 Jan 2026)) is formulated as follows: suppose, for some constant $c > 0$, every family

$$F_{m,k}(X) = \sum_{e \in \binom{b(m)}{k}} G_m(X, e) \in\ ^0[P]$$

with $\tau(G_m) \leq m$ and $b(m) = m^{O(1)}$ can be computed by a constant-free algebraic circuit of size $2^{o(n)} \cdot \mathrm{poly}(m)$, where $n = k\log m/c$. Then, the so-called log-variate exponential-sum family $p_{m,k}$ defined analogously would also lie in $^0$, that is, be fpt-computable. However, under the $\tau$-conjecture, one establishes (Theorem 5.10) that $p_{m,k} \notin\ ^0$, leading to:

Corollary (Exponential fpt-lower bound). Assuming the $\tau$-conjecture, there is an explicit infinite family in VW$_{nb}^0$[P] such that any constant-free, unbounded-degree algebraic circuit family computing it must have size at least $2^{\Omega(n)} \cdot \mathrm{poly}(m)$, for $n = k\log m/C$ with some absolute constant $C > 0$.

Thus, the class admits unconditional (under the conjecture) exponential fpt lower bounds for explicit families.

3. Key Technical Ingredients and Proof Sketch

The exponential lower bound leverages several critical steps:

(A) Reduction from Exponential-Sum Lower Bound: The proof establishes that if every VW$_{nb}^0$[P] family were computable by $2^{o(n)} \cdot \mathrm{poly}(m)$-size circuits, then certain “universal” log-variate exponential-sum families $p_{m,k}$ would also lie in $^0$, a contradiction under the $\tau$-conjecture.

(B) Derivation from Linear Counting Hierarchy: Theorem 5.10 (p$_{m,k}$ $\notin$ $^0$ under $\tau$-conjecture) exploits the fact that polynomial families $p_{m,k}$, if in $^0$, would imply that every integer and those univariate polynomials with coefficients definable in the linear counting hierarchy CHP would possess sub-polynomial $\tau$-complexity—a statement refuted by the application of the $\tau$-conjecture to Pochhammer polynomials $p_n(X) = \prod_{i=1}^n (X+i)$.

(C) Translation to Sum-of-Circuits Bound: An arbitrary VW$_{nb}^0$[P] summation

$F_{m,k}(X) = \sum_{y \in \{0,1\}^\ell} g(X, y)$

is encoded into a $k$-fold sum of circuits of size about $\log m$ with only polynomial overhead, showing that any $2^{o(n)}$-size circuit at this level would yield a fixed-parameter tractable circuit for $p_{m,k}$, which is impossible under the conjecture.

4. Consequences for the Linear Counting Hierarchy

If the log-variate exponential-sum family $p_{m,k}$ were fpt-computable in the constant-free, unbounded model (i.e., if VW$_{nb}^0$[P] $= ^0$), then the linear counting hierarchy CHP—and more generally the sub-exponential hierarchy CH$_{\text{SUBEXP}}$—would collapse.

Theorem (Collapse of CHP). If $p_{m,k} \in ^0$, then for every language $L \in$ CHP, there exists, for input $x$ of length $n$, a constant-free algebraic circuit $\chi_L$ of size $2^{o(n)}$ that decides $x$'s membership in $L$ (output $1 \leftrightarrow$ yes, $0 \leftrightarrow$ no). Thus, CH$_{\text{SUBEXP}} \subseteq$ SUBEXP-size constant-free circuits, which would constitute a collapse.

Moreover, every integer sequence or univariate polynomial definable in CHP would have $\tau$-complexity $n^{o(1)}$, ruled out (under the $\tau$-conjecture) by the complexity of Pochhammer polynomials (Bhattacharjee et al., 1 Jan 2026).

5. Permanent-Based Characterization via the Class VW[F]

VW[F] is a class defined analogously to VW[P], but with formulas (of bounded degree) replacing circuits: $$F_{n,k}(X) = \sum_{y \in \langle q(n) \rangle^k} G_n(X, y),$$ where $G_n$ is computed by a size-$q(n)$ algebraic formula.

VW[F] admits a tight graph-theoretic characterization:

• For $c$, $b$ fixed, on any family of $(c, b)$-nice graphs $G_n$ (whose vertex set $V$ partitions into $V=V_1\cup V_2$ with specified cycle and treewidth properties), the $(k, c)$-restricted permanent,

$\operatorname{per}^{(k,\leq c)}(G_n),$

where cycle covers contain one cycle of length $k$ and all others of length $\leq c$, lies in VWF.

• Over characteristic zero, there exists $b$ and a family of $(4, b)$-nice graphs $H_n$ so that

$\operatorname{per}^{(3k, \leq 4)}(H_n)$

is VW[F]-hard (under fpt-substitutions; Theorem 7.4).

This mirrors Valiant's permanent completeness for VNP, but with the additional structure that only one cycle has parameterized length $k$ and all others are of bounded length, and the host graph admits a “nice” partition enabling bounded-treewidth reductions.

6. Comparative Structure and Open Problems

VW[F] lies strictly below VW[P] in expressive power under current knowledge. It remains open whether VW[F] = VW[P]. The permanent-based completeness characterization for VW[F] provides both positive containment results (polynomial families within the class) and hardness results (via restricted permanents on nice graphs).

A summary of dependencies established in (Bhattacharjee et al., 1 Jan 2026):

Assumption/Implication	Consequence
$\tau$-conjecture	$p \notin ^0$ (Section 5)
$p \notin ^0$	No subexponential circuits for VW$_{nb}^0$P
(Conversely) VW$_{nb}^0$[P] = $^0$	$p \in ^0$ ⇒ Collapse of CHP (Section 4)

A plausible implication is that the further understanding of the constant-free, unbounded-degree paradigm and its lower bounds not only elucidates the structure of parameterized algebraic complexity classes, but also provides a fertile test site for conjectures such as the Shub–Smale $\tau$-conjecture, with consequences for hierarchy collapses in the algebraic world.

7. Connections to Foundational Complexity Theory

VW$_{nb}^0$[P] encapsulates the parameterized analog of bounded (in Hamming weight) exponential sums over algebraic circuits, with results in (Bhattacharjee et al., 1 Jan 2026) marking the first use of the $\tau$-conjecture to obtain explicit exponential lower bounds for such sums. These results connect the VP vs. VNP framework, algebraic circuit complexity, parameterized computation, and counting hierarchies, situating VW$_{nb}^0$[P] as a central class in the algebraic parameterized landscape. The links to linear counting hierarchy and Pochhammer polynomial complexity position this class at the interface of circuit size lower bounds, definability in counting structures, and the algebraic analogs of classical parameterized complexity classes.