Abstract
In this article, we study the identity testing problem of arithmetic read-once formulas (ROFs) and some related models. An ROF is a formula (a circuit whose underlying graph is a tree) in which the operations are { +, × } and such that every input variable labels at most one leaf. We obtain the first polynomial-time deterministic identity testing algorithm that operates in the black-box setting for ROFs, as well as some other related models. As an application, we obtain the first polynomial-time deterministic reconstruction algorithm for such formulas. Our results are obtained by improving and extending the analysis of the algorithm of Shpilka and Yolkovich [51].
- M. Agrawal. 2005. Proving lower bounds via pseudo-random generators. In FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science, Vol. 3821. Springer, 92--105. Google Scholar
Digital Library
- M. Agrawal, N. Kayal, and N. Saxena. 2004. PRIMES is in P. Annals of Mathematics 160, 2, 781--793.Google Scholar
- M. Agrawal, C. Saha, R. Saptharishi, and N. Saxena. 2012. Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas and depth-3 transcendence degree-k circuits. In Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC’12). 599--614. Google Scholar
Digital Library
- M. Agrawal, C. Saha, and N. Saxena. 2013. Quasi-polynomial hitting-set for set-depth-Delta formulas. In Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC’13). 321--330. Google Scholar
Digital Library
- N. Alon. 1999. Combinatorial nullstellensatz. Combinatorics, Probability and Computing 8, 7--29. Google Scholar
Cross Ref
- M. Anderson, M. A. Forbes, R. Saptharishi, A. Shpilka, and B. L. Volk. 2016. Identity testing and lower bounds for read-k oblivious algebraic branching programs. In Proceedings of the 31st Conference on Computational Complexity (CCC’16). 30:1--30:25. Google Scholar
Digital Library
- M. Anderson, D. van Melkebeek, and I. Volkovich. 2015. Derandomizing polynomial identity testing for multilinear constant-read formulae. Computational Complexity 24, 4, 695--776. Google Scholar
Digital Library
- D. Angluin, L. Hellerstein, and M. Karpinski. 1993. Learning read-once formulas with queries. Journal of the ACM 40, 1, 185--210. Google Scholar
Digital Library
- S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. 1998. Proof verification and the hardness of approximation problems. Journal of the ACM 45, 3, 501--555. Google Scholar
Digital Library
- S. Arora and S. Safra. 1998. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM 45, 1, 70--122. Google Scholar
Digital Library
- V. Arvind and P. Mukhopadhyay. 2010. The monomial ideal membership problem and polynomial identity testing. Information and Computation 208, 4, 351--363. Google Scholar
Digital Library
- M. Beecken, J. Mittmann, and N. Saxena. 2011. Algebraic independence and blackbox identity testing. In Proceedings of the 38th International Colloquium on Automata, Languages, and Programming (ICALP’11). 137--148. Google Scholar
Digital Library
- M. Ben-Or and P. Tiwari. 1988. A deterministic algorithm for sparse multivariate polynominal interpolation. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC’88). 301--309. Google Scholar
Digital Library
- D. Bshouty and N. H. Bshouty. 1998. On interpolating arithmetic read-once formulas with exponentiation. Journal of Computer and System Sciences 56, 1, 112--124. Google Scholar
Digital Library
- N. H. Bshouty and R. Cleve. 1998. Interpolating arithmetic read-once formulas in parallel. SIAM Journal on Computing 27, 2, 401--413. Google Scholar
Digital Library
- N. H. Bshouty, T. R. Hancock, and L. Hellerstein. 1995. Learning arithmetic read-once formulas. SIAM Journal on Computing 24, 4, 706--735. Google Scholar
Digital Library
- N. H. Bshouty, T. R. Hancock, and L. Hellerstein. 1995. Learning Boolean read-once formulas with arbitrary symmetric and constant fan-in gates. Journal of Computer and System Sciences 50, 521--542. Google Scholar
Digital Library
- R. A. DeMillo and R. J. Lipton. 1978. A probabilistic remark on algebraic program testing. Information Processing Letters 7, 4, 193--195.Google Scholar
Cross Ref
- Z. Dvir and A. Shpilka. 2006. Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits. SIAM Journal on Computing 36, 5, 1404--1434. Google Scholar
Digital Library
- S. A. Fenner, R. Gurjar, and T. Thierauf. 2016. Bipartite perfect matching is in quasi-NC. In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing (STOC’16). 754--763. Google Scholar
Digital Library
- M. A. Forbes, R. Saptharishi, and A. Shpilka. 2014. Pseudorandomness for multilinear read-once algebraic branching programs, in any order. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC’14). 867--875. Full version at https://eccc.weizmann.ac.il/report/2013/132Google Scholar
- M. A. Forbes and A. Shpilka. 2013. Explicit Noether normalization for simultaneous conjugation via polynomial identity testing. In Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques. Lecture Notes in Computer Science, Vol. 8096. Springer, 527--542.Google Scholar
- M. A. Forbes and A. Shpilka. 2013. Quasipolynomial-time identity testing of non-commutative and read-once oblivious algebraic branching programs. In Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS’13). 243--252. Google Scholar
Digital Library
- M. A. Forbes, A. Shpilka, I. Tzameret, and A. Wigderson. 2016. Proof complexity lower bounds from algebraic circuit complexity. In Proceedings of the 31st Conference on Computational Complexity (CCC’16). 32:1--32:17. Google Scholar
Digital Library
- A. Gupta. 2014. Algebraic geometric techniques for depth-4 PIT and Sylvester-Gallai conjectures for varieties. Electronic Colloquium on Computational Complexity 21, 130. https://eccc.weizmann.ac.il/report/2014/130Google Scholar
- R. Gurjar, A. Korwar, and N. Saxena. 2016. Identity testing for constant-width, and commutative, read-once oblivious ABPs. In Proceedings of the 31st Conference on Computational Complexity (CCC’16). 29:1--29:16. Google Scholar
Digital Library
- R. Gurjar, A. Korwar, N. Saxena, and N. Thierauf. 2015. Deterministic identity testing for sum of read-once oblivious arithmetic branching programs. In Proceedings of the 30th Conference on Computational Complexity (CCC’15). 323--346. Google Scholar
Digital Library
- T. R. Hancock and L. Hellerstein.1991. Learning read-once formulas over fields and extended bases. In Proceedings of the 4th Annual Workshop on Computational Learning Theory (COLT’91). 326--336. Google Scholar
Digital Library
- J. Heintz and C. P. Schnorr. 1980. Testing polynomials which are easy to compute (extended abstract). In Proceedings of the 12th Annual ACM Symposium on Theory of Computing (STOC’80). 262--272. Google Scholar
Digital Library
- M. Karchmer, N. Linial, I. Newman, M. E. Saks, and A. Wigderson. 1993. Combinatorial characterization of read-once formulae. Discrete Mathematics 114, 1--3, 275--282. Google Scholar
Digital Library
- Z. S. Karnin, P. Mukhopadhyay, A. Shpilka, and I. Volkovich. 2013. Deterministic identity testing of depth 4 multilinear circuits with bounded top fan-in. SIAM Journal on Computing 42, 6, 2114--2131.Google Scholar
Cross Ref
- Z. S. Karnin and A. Shpilka. 2011. Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in. Combinatorica 31, 3, 333--364. Google Scholar
Digital Library
- N. Kayal and S. Saraf. 2009. Blackbox polynomial identity testing for depth 3 circuits. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS’09). 198--207. https://eccc.weizmann.ac.il/report/2009/032 Google Scholar
Digital Library
- N. Kayal and N. Saxena. 2007. Polynomial identity testing for depth 3 circuits. Computational Complexity 16, 2, 115--138. Google Scholar
Digital Library
- A. Klivans and D. Spielman. 2001. Randomness efficient identity testing of multivariate polynomials. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC’01). 216--223. Google Scholar
Digital Library
- M. Kumar and S. Saraf. 2016. Arithmetic circuits with locally low algebraic rank. In Proceedings of the 31st Conference on Computational Complexity (CCC’16). 34:1--34:27. Google Scholar
Digital Library
- M. Kumar and S. Saraf. 2016. Sums of products of polynomials in few variables: Lower bounds and polynomial identity testing. In Proceedings of the 31st Conference on Computational Complexity (CCC’16). 35:1--35:29. Google Scholar
Digital Library
- R. J. Lipton and N. K. Vishnoi. 2003. Deterministic identity testing for multivariate polynomials. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’03). 756--760. Google Scholar
Digital Library
- L. Lovasz. 1979. On determinants, matchings, and random algorithms. In Fundamentals of Computing Theory, L. Budach (Ed.). Akademia-Verlag.Google Scholar
- C. Lund, L. Fortnow, H. Karloff, and N. Nisan. 1992. Algebraic methods for interactive proof systems. Journal of the ACM 39, 4, 859--868. Google Scholar
Digital Library
- P. Mukhopadhyay. 2016. Depth-4 identity testing and Noether’s normalization lemma. In Proceedings of the 11th International Computer Science Symposium on Computer Science—Theory and Applications—Volume 9691. (CSR’16). 309--323. Google Scholar
Digital Library
- K. Mulmuley, U. Vazirani, and V. Vazirani. 1987. Matching is as easy as matrix inversion. Combinatorica 7, 1, 105--113. Google Scholar
Digital Library
- N. Saxena. 2008. Diagonal circuit identity testing and lower bounds. In Proceedings of the 35th International Colloquium on Automata, Languages, and Programming. 60--71. https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-124/index.html. Google Scholar
Digital Library
- N. Saxena and C. Seshadhri. 2010. From Sylvester-Gallai configurations to rank bounds: Improved black-box identity test for deph-3 circuits. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS’10). 21--30. Google Scholar
Digital Library
- N. Saxena and C. Seshadhri. 2011. An almost optimal rank bound for depth-3 identities. SIAM Journal on Computing 40, 1, 200--224. Google Scholar
Digital Library
- J. T. Schwartz. 1980. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM 27, 4, 701--717. Google Scholar
Digital Library
- A. Shamir. 1990. IP=PSPACE. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science (FOCS’90). 11--15.Google Scholar
- A. Shpilka and I. Volkovich. 2008. Read-once polynomial identity testing. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC’08). 507--516. Google Scholar
Digital Library
- A. Shpilka and I. Volkovich. 2009. Improved polynomial identity testing for read-once formulas. In Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques (APPROX’09/RANDOM’09). 700--713. https://eccc.weizmann.ac.il/report/2010/011. Google Scholar
Digital Library
- A. Shpilka and I. Volkovich. 2014. On reconstruction and testing of read-once formulas. Theory of Computing 10, 465--514.Google Scholar
Cross Ref
- A. Shpilka and I. Volkovich. 2015. Read-once polynomial identity testing. Computational Complexity 24, 3, 477--532. Google Scholar
Digital Library
- A. Shpilka and A. Yehudayoff. 2010. Arithmetic circuits: A survey of recent results and open questions. Foundations and Trends in Theoretical Computer Science 5, 3--4, 207--388. Google Scholar
Digital Library
- I. Volkovich. 2016. Characterizing arithmetic read-once formulae. ACM Transactions on Computation Theory 8, 1, 2. Google Scholar
Digital Library
- R. Zippel. 1979. Probabilistic algorithms for sparse polynomials. In Proceedings of the International Symposium on Symbolic and Algebraic Computation. 216--226. Google Scholar
Digital Library
Index Terms
Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas
Recommendations
Read-once polynomial identity testing
STOC '08: Proceedings of the fortieth annual ACM symposium on Theory of computingIn 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. An nO(k2) algorithm for checking whether given k ROFs sum to zero or not. ...
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
STOC '10: Proceedings of the forty-second ACM symposium on Theory of computingWe give the first sub-exponential time deterministic polynomial identity testing algorithm for depth-4 multilinear circuits with a small top fan-in. More accurately, our algorithm works for depth-4 circuits with a plus gate at the top (also known as ...
Complete derandomization of identity testing and reconstruction of read-once formulas
CCC '17: Proceedings of the 32nd Computational Complexity ConferenceIn this paper we study the identity testing problem of arithmetic read-once formulas (ROF) and some related models. A read-once formula is formula (a circuit whose underlying graph is a tree) in which the operations are {+, ×} and such that every input ...






Comments