Read-once polynomial identity testing

Amir Shpilka*, Ilya Volkovich

*Corresponding author for this work

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

31 Scopus citations


In this paper we study the problems of polynomial identity testing (PIT) and reconstruction of read-once formulas. The following are some deterministic algorithms that we obtain. 1. An nO2) algorithm for checking whether given κ ROFs sum to zero or not. 2. An n O(d+κ2 ) time algorithm for checking whether a black box holding the sum of κ depth d ROFs computes the zero polynomial. In other words, we provide a hitting set of size nO(d+κ 2 ) for the sum of κ depth d ROFs. This implies an n O(d) deterministic algorithm for the reconstruction of depth d ROFs. 3. A hitting set of size exp(script O sigñ(√n + κ2) ) for the sum of κ ROFs (without depth restrictions). This implies a sub-exponential time deterministic algorithm for black-box identity testing and reconstructing of ROFs. To the best of our knowledge our results give the first polynomial time (non black-box) and sub-exponential time (black-box) identity testing algorithms for the sum of (a constant number of) ROFs. In addition, we introduce and study the read-once testing problem (ROT for short): Given an arithmetic circuit computing a polynomial P(x̄), decide whether there is a ROF computing P(x̄). If there is such a formula then output it. Otherwise output "No". We show that most previous algorithms for polynomial identity testing can be strengthen to yield algorithms for the ROT problem. In particular we give ROT algorithms for: Depth-2 circuits (circuits computing sparse polynomials), Depth-3 circuits with bounded top fan-in (both in the black-box and non black-box settings, where the running time depends on the model), non-commutative formulas and sum of κ ROFs. The running time of the ROT algorithm is essentially the same running time as the corresponding PIT algorithm for the class. The main tool in most of our results is a new connection between polynomial identity testing and reconstruction of read-once formulas. Namely, we show that in any model that is closed under partial derivatives (that is, a partial derivative of a polynomial computed by a circuit in the model, can also be computed by a circuit in the model) and that has an efficient deterministic polynomial identity testing algorithm, we can also answer the read-once testing problem.

Original languageEnglish
Title of host publicationSTOC'08
Subtitle of host publicationProceedings of the 2008 ACM Symposium on Theory of Computing
PublisherAssociation for Computing Machinery (ACM)
Number of pages10
ISBN (Print)9781605580470
StatePublished - 2008
Externally publishedYes
Event40th Annual ACM Symposium on Theory of Computing, STOC 2008 - Victoria, BC, Canada
Duration: 17 May 200820 May 2008

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017


Conference40th Annual ACM Symposium on Theory of Computing, STOC 2008
CityVictoria, BC


  • Arithmetic circuits
  • Bounded depth circuits
  • Identity testing
  • Read-once formulas
  • Reconstruction


Dive into the research topics of 'Read-once polynomial identity testing'. Together they form a unique fingerprint.

Cite this