Recent results on polynomial identity testing

Amir Shpilka*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations


Polynomial Identity Testing (PIT) is a fundamental problem in algebraic complexity: We are given a circuit computing a multivariate polynomial, over some field F, and we have to determine whether it is identically zero or not. Note that we want the polynomial to be identically zero and not just to be equal to the zero function so, for example, x2-x is the zero function over F2 but not the zero polynomial. The importance of this problem follows from its many applications: Algorithms for primality testing [2, 3], for deciding if a graph contains a perfect matching [19, 20, 8] and more, are based on reductions to the PIT problem (see the introduction of [18] for more applications).

Original languageEnglish
Title of host publicationComputer Science - Theory and Applications - 6th International Computer Science Symposium in Russia, CSR 2011, Proceedings
Number of pages4
StatePublished - 2011
Externally publishedYes
Event6th International Computer Science Symposium in Russia, CSR 2011 - St. Petersburg, Russian Federation
Duration: 14 Jun 201118 Jun 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6651 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference6th International Computer Science Symposium in Russia, CSR 2011
Country/TerritoryRussian Federation
CitySt. Petersburg


Dive into the research topics of 'Recent results on polynomial identity testing'. Together they form a unique fingerprint.

Cite this