[Paper Review] New results on Noncommutative and Commutative Polynomial Identity Testing

V. Arvind, Partha Mukhopadhyay+1 more|arXiv (Cornell University)|Jan 3, 2008

Complexity and Algorithms in Graphs17 references4 citations

TL;DR

This paper presents a deterministic polynomial-time identity test for noncommutative circuits and black-box polynomials using automata-theoretic techniques, enabling full reconstruction of noncommutative algebraic branching programs and extending efficient identity testing to polynomials over finite commutative rings with unity.

ABSTRACT

Using ideas from automata theory we design a new efficient (deterministic) identity test for the noncommutative polynomial identity testing problem (first introduced and studied in [RS05, BW05]). More precisely, given as input a noncommutative circuit C(x1, · · · , xn) computing a polynomial in F{x1, · · · , xn} of degree d with at most t monomials, where the variables xi are noncommuting, we give a deterministic polynomial identity test that checks if C ≡ 0 and runs in time polynomial in d, n, |C|, and t. The same methods works in a black-box setting: Given a noncommuting black-box polynomial f ∈ F{x1, · · · , xn} of degree d with t monomials we can, in fact, reconstruct the entire polynomial f in time polynomial in n, d and t. Indeed, we apply this idea to the reconstruction of black-box noncommuting algebraic branching programs (the ABPs considered by Nisan in [N91] and Raz-Shpilka in [RS05]). Assuming that the black-box model allows us to query the ABP for the output at any given gate then we can reconstruct an (equivalent) ABP in deterministic polynomial time. Finally, we turn to commutative identity testing and explore the complexity of the problem when the coefficients of the input polynomial come from an arbitrary finite commutative ring with unity whose elements are uniformly encoded as strings and the ring operations are given by an oracle. We show that several algorithmic results for polynomial identity testing over fields also hold when the coefficients come from such finite rings. 1

Motivation & Objective

• To develop an efficient deterministic identity test for noncommutative circuits with bounded degree and monomial count.
• To enable full reconstruction of black-box noncommutative polynomials and algebraic branching programs (ABPs) in deterministic polynomial time.
• To extend polynomial identity testing algorithms from fields to arbitrary finite commutative rings with unity, where operations are oracle-accessible.
• To generalize known results from field-based identity testing to the broader setting of finite rings with uniform string encoding.

Proposed method

• Leverages automata-theoretic ideas to design a deterministic identity test for noncommutative circuits with degree d, n variables, and at most t monomials.
• Uses the structure of noncommutative monomials to simulate their evaluation via finite automata, enabling efficient identity checking.
• Applies the same framework to reconstruct the entire polynomial from black-box access in time polynomial in n, d, and t.
• Adapts the identity testing approach to work over finite commutative rings with unity by replacing field operations with oracle-provided ring operations.
• Employs a black-box model where queries to an ABP return output values at specified gates, enabling deterministic reconstruction of an equivalent ABP.
• Reduces the problem of identity testing over rings to equivalent problems over fields, preserving efficiency under uniform encoding and oracle access.

Experimental results

Research questions

• RQ1 Can a deterministic polynomial-time identity test be constructed for noncommutative circuits with bounded degree and monomial count using automata-theoretic methods?
• RQ2 Is it possible to reconstruct a noncommutative black-box polynomial or ABP from oracle queries in deterministic polynomial time?
• RQ3 Do existing efficient identity testing results for polynomials over fields extend to polynomials with coefficients in arbitrary finite commutative rings with unity?
• RQ4 How does the complexity of identity testing change when ring operations are accessed via an oracle rather than computed directly?
• RQ5 Can the structure of noncommutative monomials be exploited to design a black-box reconstruction algorithm for ABPs?

Key findings

• A deterministic polynomial identity test for noncommutative circuits is developed, running in time polynomial in d, n, |C|, and t.
• The same method enables full reconstruction of a black-box noncommutative polynomial with t monomials in time polynomial in n, d, and t.
• An equivalent algebraic branching program can be reconstructed in deterministic polynomial time from black-box access to its output at any gate.
• The results on identity testing over fields extend to polynomials with coefficients in any finite commutative ring with unity, provided operations are accessible via an oracle.
• The framework maintains efficiency and correctness under uniform string encoding of ring elements and oracle-based ring operations.
• The approach establishes a bridge between automata theory and algebraic complexity, enabling new algorithmic solutions in noncommutative and ring-based identity testing.