Polynomial Complexity Theorem

• Polynomial Complexity Theorem is a schema of results that establishes explicit polynomial bounds by identifying key structural invariants, replacing uncontrolled growth with measurable limits.
• It spans diverse areas—rational simplex integration, tropical algebra, proof complexity, and quantum systems—demonstrating how fixed structural conditions yield tractable, polynomial outcomes.
• Concrete examples include polynomial-time integration over rational simplices, homotopy-based average-case refinements, and bond-dimension theorems in 1D quantum systems that translate into practical algorithmic improvements.

In the literature represented here, “Polynomial Complexity Theorem” does not denote a single canonical theorem. It designates a recurring theorem pattern: a result establishing polynomial-time computability, polynomial-size proofs, polynomial bond dimension, polynomial tropical complexity, polynomial-hierarchy containment, or a sharp tractable/intractable dichotomy under explicitly stated structural hypotheses. Typical instances include exact integration over rational simplices under fixed structural parameters (0809.2083), polynomial tropical semiring complexity for Schur and skew Schur polynomials (Woo et al., 2017), the compact real analogue of Toda’s theorem $${\bf PH}^c_{\mathbb R}\subset {\bf P}_{\mathbb R}^{\#{\bf P}_{\mathbb R}^{\dagger}}$$ (0812.1200), restricted polynomial-size propositional proofs for Kneser–Lovász formulas (Istrate et al., 2014), algorithmic Polynomial Freiman–Ruzsa over $\mathbb F_2^n$ (Castro-Silva et al., 6 Apr 2026), and polynomial bond-dimension consequences of spectral small-incremental-entangling for 1D long-range quantum systems (Kim et al., 15 Sep 2025). This suggests that the phrase functions less as a standardized theorem name than as a theorem schema for polynomially controlled structure.

1. Taxonomy of polynomial-complexity statements

Across these works, several recurrent theorem types appear: structural upper bounds, complexity-class containments, dichotomy theorems, polynomial proof-complexity upper bounds in strong systems, and structure-vs-randomness transfer principles. The common feature is not the domain but the form of the conclusion: a quantitatively polynomial bound replaces an exponential, quasi-polynomial, or nonconstructive statement.

Setting	Polynomial statement	Representative paper
Rational simplex integration	Polynomial time for fixed effective variable count or fixed degree; NP-hard in general	(0809.2083)
Tropical symmetric polynomials	$\operatorname{Trop}(s_{\lambda/\mu})$ has complexity $O(n^2\lambda_1)$	(Woo et al., 2017)
Real semi-algebraic complexity	$${\bf PH}_{\mathbb R}^c \subset {\bf P}_{\mathbb R}^{\#{\bf P}_{\mathbb R}^{\dagger}}$$	(0812.1200)
Homomorphism polynomials	$VAC$/$VNP$ dichotomy by fixed target graph $H$	(Rugy-Altherre, 2012)
Additive combinatorics	Polynomial-time algorithmic PFR recovery of a covering subspace	(Castro-Silva et al., 6 Apr 2026)
Long-range quantum systems	Polynomial bond-dimension approximation theorems	(Kim et al., 15 Sep 2025)

A second recurring feature is that many such theorems are conditional on a structural regime rather than unconditional on all inputs. Fixed degree, fixed effective variable number, fixed proof system, bounded doubling, compactness, or $\eta>2$ long-range decay are typical hypotheses. A common misconception is therefore that “polynomial complexity theorem” always means unrestricted polynomial-time solvability; in much of the literature, it instead means that a previously uncontrolled or quasi-polynomial phenomenon becomes polynomial once the correct invariant is identified.

2. Algebraic, tropical, and proof-theoretic constructions

In exact symbolic computation, Baldoni, Berline, De Loera, Köppe, and Vergne establish a sharp classification for integrating a polynomial over a rational simplex: exact integration is NP-hard for general polynomials, but polynomial-time solvable when the polynomial depends on a fixed number $D$ of linear forms, and also polynomial-time solvable for fixed total degree $\mathbb F_2^n$0 (0809.2083). The theorem is paradigmatic because it isolates the precise source of tractability: not low ambient dimension, but low effective algebraic complexity of the integrand.

Woo and Yong prove a different kind of polynomial-complexity theorem in tropical algebraic combinatorics. If a homogeneous symmetric polynomial $\mathbb F_2^n$1 is dominated by a Schur polynomial $\mathbb F_2^n$2, then $\mathbb F_2^n$3, and hence its tropical semiring complexity is at most $\mathbb F_2^n$4; for every skew shape $\mathbb F_2^n$5, they identify an explicit partition $\mathbb F_2^n$6 with $\mathbb F_2^n$7 such that $\mathbb F_2^n$8, yielding the same $\mathbb F_2^n$9 bound for all skew Schur polynomials (Woo et al., 2017). The underlying mechanism is geometric: equality of Newton polytopes plus the saturated Newton polytope property collapses tropical complexity to that of a single dominating Schur polynomial.

Bürgisser’s factor theorem supplies an algebraic-complexity closure principle of a different kind. Over characteristic-zero fields, if $\operatorname{Trop}(s_{\lambda/\mu})$0 is a degree-$\operatorname{Trop}(s_{\lambda/\mu})$1 factor of a polynomial of low approximative complexity, then $\operatorname{Trop}(s_{\lambda/\mu})$2 is polynomially bounded in $\operatorname{Trop}(s_{\lambda/\mu})$3 and in the approximative complexity of a nonzero multiple of $\operatorname{Trop}(s_{\lambda/\mu})$4, specifically

$\operatorname{Trop}(s_{\lambda/\mu})$5

and this yields graph-checkability $\operatorname{Trop}(s_{\lambda/\mu})$6 approximative computability for bounded-degree polynomial families (Bürgisser, 2018). The theorem extends Kaltofen’s factor-complexity result by removing multiplicity dependence at the price of passing from straight-line complexity to approximative complexity.

A further constructive variant appears in the new proof of the Schwartz–Zippel lemma. For a degree-$\operatorname{Trop}(s_{\lambda/\mu})$7 circuit $\operatorname{Trop}(s_{\lambda/\mu})$8 in $\operatorname{Trop}(s_{\lambda/\mu})$9 variables and a cube $O(n^2\lambda_1)$0, the paper constructs a polynomial-time computable and polynomial-time invertible surjection

$O(n^2\lambda_1)$1

onto the root set $O(n^2\lambda_1)$2, formalizable in $O(n^2\lambda_1)$3 (Atserias et al., 2024). This yields the exact compression bound $O(n^2\lambda_1)$4, allows $O(n^2\lambda_1)$5 to prove polynomial-size circuits for PIT, proves existence of small hitting sets for every explicitly described class of polynomial-degree circuits, and shows that existence of such hitting sets is equivalent over $O(n^2\lambda_1)$6 to $O(n^2\lambda_1)$7. The constructive content is stronger than the classical root count: it turns a counting lemma into a feasible coding theorem.

3. Complexity containments and numerical continuation

The real analogue of Toda’s theorem is one of the clearest uses of “polynomial complexity theorem” as a containment theorem. Basu proves

$O(n^2\lambda_1)$8

where $O(n^2\lambda_1)$9 is defined by Poincaré polynomials of fibers rather than finite cardinality, and also proves that for every $${\bf PH}_{\mathbb R}^c \subset {\bf P}_{\mathbb R}^{\#{\bf P}_{\mathbb R}^{\dagger}}$$0, $${\bf PH}_{\mathbb R}^c \subset {\bf P}_{\mathbb R}^{\#{\bf P}_{\mathbb R}^{\dagger}}$$1 reduces in deterministic polynomial time in the Blum–Shub–Smale model to computing Poincaré polynomials (0812.1200). The theorem replaces discrete counting by topological invariants—Betti numbers and Poincaré polynomials—as the operative polynomial resource in semi-algebraic complexity. The compactness restriction is essential rather than cosmetic; the paper does not prove the full noncompact analogue.

Beltrán and Kozhasov give an average-case polynomial-complexity refinement for Smale’s 17th problem via homotopy continuation. Their randomized algorithm for square homogeneous polynomial systems has average number of continuation steps bounded by

$${\bf PH}_{\mathbb R}^c \subset {\bf P}_{\mathbb R}^{\#{\bf P}_{\mathbb R}^{\dagger}}$$2

improving the earlier $${\bf PH}_{\mathbb R}^c \subset {\bf P}_{\mathbb R}^{\#{\bf P}_{\mathbb R}^{\dagger}}$$3 bound, and hence average arithmetic complexity $${\bf PH}_{\mathbb R}^c \subset {\bf P}_{\mathbb R}^{\#{\bf P}_{\mathbb R}^{\dagger}}$$4 since one Newton step costs $${\bf PH}_{\mathbb R}^c \subset {\bf P}_{\mathbb R}^{\#{\bf P}_{\mathbb R}^{\dagger}}$$5 (Armentano et al., 2015). They also reprove the deterministic Bürgisser–Cucker theorem by homotopy methods alone: there is a deterministic real-number algorithm that computes an approximate zero in average time $${\bf PH}_{\mathbb R}^c \subset {\bf P}_{\mathbb R}^{\#{\bf P}_{\mathbb R}^{\dagger}}$$6, and polynomial average time when $${\bf PH}_{\mathbb R}^c \subset {\bf P}_{\mathbb R}^{\#{\bf P}_{\mathbb R}^{\dagger}}$$7 or $${\bf PH}_{\mathbb R}^c \subset {\bf P}_{\mathbb R}^{\#{\bf P}_{\mathbb R}^{\dagger}}$$8. Here the polynomial-complexity content lies not in worst-case decision complexity but in average certified continuation complexity governed by condition length.

These containment and continuation theorems exhibit a characteristic pattern. Polynomial complexity is not stated as a direct bound on naïve symbolic manipulation; it is mediated by an invariant—Poincaré polynomial, condition number, or condition length—that compresses the effective hardness of the problem.

4. Proof complexity and algebraic search complexity

In propositional proof complexity, Istrate and Crăciun show that formulas encoding the Kneser–Lovász theorem form a genuine generalization of the pigeonhole principle: $${\bf PH}_{\mathbb R}^c \subset {\bf P}_{\mathbb R}^{\#{\bf P}_{\mathbb R}^{\dagger}}$$9 is essentially $VAC$0, and for every fixed $VAC$1,

$VAC$2

while bounded-depth Frege proofs require size $VAC$3 for every fixed depth $VAC$4 (Istrate et al., 2014). At the same time, they prove polynomial-size upper bounds only in restricted low-$VAC$5 cases: $VAC$6 has polynomial-size Frege proofs, and $VAC$7 has polynomial-size extended Frege proofs. The paper does not prove polynomial-size Frege or EF proofs for arbitrary fixed $VAC$8, and it explicitly leaves polynomial-size ordinary Frege proofs for $VAC$9 open. The resulting “polynomial complexity theorem” is therefore sharply delimited: the theorem isolates exactly where polynomial proof length is known, against a background of exponential lower bounds in weaker systems.

Göös, Kaminski, and Sosnovec provide a complementary complexity classification for algebraic total search. They prove that PPA-CIRCUIT CNSS and PPA-CIRCUIT CHEVALLEY, two search problems derived from the Combinatorial Nullstellensatz and Chevalley–Warning theorem over $VNP$0, are PPA-complete (Belovs et al., 2017). The key technical device is the PPA-circuit: an arithmetic circuit whose maximal parse subcircuits can be paired in polynomial time, forcing parity of top-degree monomials and hence totality. This is not a polynomial-time solvability theorem, but it is a polynomial-time classification theorem: the algebraic parity principle is shown to sit exactly at PPA-complete search complexity.

These results correct another common misconception. In proof complexity, a polynomial-complexity theorem may mean a theorem about proof size or search-class completeness, not about decision-time tractability. The notion is thus proof-theoretic and structural as much as algorithmic.

5. Dichotomies, additive structure, and polynomial patterns

A dichotomy theorem gives perhaps the cleanest form of polynomial-complexity classification. De Rugy-Altherre proves that for every fixed graph $VNP$1, the homomorphism polynomial family $VNP$2 lies in $VNP$3 if $VNP$4 has a loop or no edges, and is $VNP$5-complete for c-reductions otherwise, over $VNP$6 (Rugy-Altherre, 2012). The theorem classifies an entire family of generating functions by a simple graph-theoretic invariant of the target. In the same paper, the cut polynomial $VNP$7 is shown to be $VNP$8-complete over $VNP$9, illustrating strong field dependence in arithmetic complexity.

The algorithmic Polynomial Freiman–Ruzsa theorem of Bhattacharyya, Ghosh, and Xie turns a structural additive-combinatorics theorem into an explicit recovery algorithm. Given $H$0 with doubling constant $H$1, there is a randomized polynomial-time algorithm that returns a basis of a subspace $H$2 satisfying $H$3 and such that $H$4 can be covered by $H$5 translates of $H$6, for a universal constant $H$7; the informal theorem gives runtime $H$8, $H$9 random samples, and $\eta>2$0 queries to $\eta>2$1 (Castro-Silva et al., 6 Apr 2026). The same framework also yields algorithmic versions of the polynomial $\eta>2$2-inverse theorem, approximate Freiman homomorphism classification, and quadratic structure-vs-randomness decompositions. Here the polynomial-complexity theorem is genuinely algorithmic: a recent existential theorem is turned into a structure-recovery procedure.

Leng’s quantitative polynomial Szemerédi theorem supplies a transfer principle of a different kind. For linearly independent $\eta>2$3 with $\eta>2$4, if $\eta>2$5 contains no progression

$\eta>2$6

then

$\eta>2$7

for $\eta>2$8 prime (Leng, 2022). More generally, the paper shows that if one can establish polynomial-type bounds on the true complexity of a polynomial progression, then one can establish polynomial-type bounds on Szemerédi’s theorem for that progression. The theorem thus links a quantitative generalized von Neumann statement to a density theorem; “polynomial complexity” refers to polynomial dependence in the controlling Gowers-uniformity parameter rather than directly to runtime.

In additive combinatorics and arithmetic circuit complexity alike, the decisive phenomenon is the same: once the correct structural invariant—doubling, true complexity, or fixed target graph—is exposed, a previously diffuse combinatorial statement collapses to a polynomially controlled classification.

6. Entanglement structure and polynomial simulation of long-range quantum systems

In 1D long-range quantum systems, the phrase takes yet another form: a polynomial-complexity theorem becomes a polynomial bond-dimension theorem. The spectral small-incremental-entangling theorem proves that for a bipartite Hamiltonian $\eta>2$9,

$D$0

with $D$1, $D$2, and $D$3 (Kim et al., 15 Sep 2025). Here $D$4 is the spectral-entangling strength, defined through the maximal $D$5-mass of the Schmidt vector created by $D$6 on a product input. This yields a universal $D$7 tail on squared Schmidt coefficients, identifies $D$8 as the sharp threshold beyond which universal growth bounds fail, and produces rigorous truncation-error control.

From this spectral control, the paper derives polynomial bond-dimension approximation theorems for 1D power-law interactions $D$9 with $\mathbb F_2^n$00. Ground states admit MPS approximants whose bond dimension can be chosen polynomial in $\mathbb F_2^n$01; for time-evolved product states, there exists an MPS $\mathbb F_2^n$02 with

$\mathbb F_2^n$03

and thermal states admit purified MPS approximants with bond dimension of order $\mathbb F_2^n$04 (Kim et al., 15 Sep 2025). The same framework yields the first rigorous precision-guarantee bound for t-DMRG. The paper is explicit, however, that ground-state and thermal-state results are primarily existential representation theorems, whereas the t-DMRG result is an explicit algorithmic guarantee. Polynomial bond dimension therefore implies polynomial representation complexity and polynomial local-observable evaluation, but not automatically a complete constructive polynomial-time algorithm for every state class.

A broadly similar lower-bound usage of the phrase occurs in pseudorandomness theory: Popoli proves that for every monic $\mathbb F_2^n$05 of degree $\mathbb F_2^n$06 with $\mathbb F_2^n$07,

$\mathbb F_2^n$08

and hence in particular $\mathbb F_2^n$09 for Rudin–Shapiro along polynomial values (Popoli, 2020). Here “polynomial complexity” no longer means efficient solvability, but a polynomial lower bound on predictive complexity along polynomial subsequences.

Taken together, these results show that “Polynomial Complexity Theorem” is best treated as an encyclopedic umbrella for theorems that polynomialize a complexity statement in a precise ambient theory. Sometimes the theorem proves tractability, sometimes it proves polynomial-size certificates or approximants, sometimes it establishes a dichotomy, and sometimes it quantifies a lower bound. What unifies the class is the replacement of uncontrolled growth by an explicit polynomial law tied to a structural invariant.