TOPICS
Search

Polynomial Identity Testing


Polynomial identity testing is the decision problem of whether an arithmetic expression computes the zero polynomial. A test may inspect the circuit or formula, or may obtain information only from evaluations. For noncommutative arithmetic formulas, a matrix hitting point is a single tuple of square matrices on which every nonzero formula in a specified class is nonzero. A hitting list instead permits a different successful tuple for each formula.


See also

Arithmetic Circuit, Noncommutative Arithmetic Formula, Polynomial, Polynomial Time

Explore with Wolfram|Alpha

References

Hrubeš, P. and Wigderson, A. "Non-Commutative Arithmetic Circuits with Division." Theory Comput. 11, 357-393, 2015. https://doi.org/10.4086/toc.2015.v011a014.Shpilka, A. and Yehudayoff, A. "Arithmetic Circuits: A Survey of Recent Results and Open Questions." Found. Trends Theor. Comput. Sci. 5, 207-388, 2010. https://doi.org/10.1561/0400000039.

Cite this as:

Weisstein, Eric W. "Polynomial Identity Testing." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/PolynomialIdentityTesting.html

Subject classifications