Skip to main content
SpringerLink
Log in
Book cover

International Computer Science Symposium in Russia

CSR 2011: Computer Science – Theory and Applications pp 397–400Cite as

Recent Results on Polynomial Identity Testing

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6651))

Abstract

Polynomial Identity Testing (PIT) is a fundamental problem in algebraic complexity: We are given a circuit computing a multivariate polynomial, over some field \(\mathbb{F}\), and we have to determine whether it is identically zero or not.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, M.: Proving lower bounds via pseudo-random generators. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 92–105. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Agrawal, M., Biswas, S.: Primality and identity testing via chinese remaindering. J. ACM 50(4), 429–443 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  3. Agrawal, M., Kayal, N., Saxena, N.: Primes is in P. Annals of Mathematics 160(2), 781–793 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  4. Agrawal, M., Vinay, V.: Arithmetic circuits: A chasm at depth four. In: Proceedings of the 49th Annual FOCS, pp. 67–75 (2008)

    Google Scholar 

  5. Anderson, M., van Melkebeek, D., Volkovich, I.: Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 17 (2010)

    Google Scholar 

  6. Arvind, V., Mukhopadhyay, P.: The monomial ideal membership problem and polynomial identity testing. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 800–811. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Arvind, V., Mukhopadhyay, P.: Derandomizing the isolation lemma and lower bounds for circuit size. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol. 5171, pp. 276–289. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  8. Chari, S., Rohatgi, P., Srinivasan, A.: Randomness-optimal unique element isolation with applications to perfect matching and related problems. SIAM J. on Computing 24(5), 1036–1050 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  9. Chen, Z., Kao, M.: Reducing randomness via irrational numbers. SIAM J. on Computing 29(4), 1247–1256 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  10. DeMillo, R.A., Lipton, R.J.: A probabilistic remark on algebraic program testing. Inf. Process. Lett. 7(4), 193–195 (1978)

    Article  MATH  Google Scholar 

  11. Dvir, Z., Shpilka, A.: Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits. SIAM J. on Computing 36(5), 1404–1434 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. Dvir, Z., Shpilka, A., Yehudayoff, A.: Hardness-randomness tradeoffs for bounded depth arithmetic circuits. SIAM J. on Computing 39(4), 1279–1293 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  13. Heintz, J., Schnorr, C.P.: Testing polynomials which are easy to compute (extended abstract). In: Proceedings of the 12th annual STOC, pp. 262–272 (1980)

    Google Scholar 

  14. Kabanets, V., Impagliazzo, R.: Derandomizing polynomial identity tests means proving circuit lower bounds. Computational Complexity 13(1-2), 1–46 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  15. Karnin, Z.S., Shpilka, A.: Deterministic black box polynomial identity testing of depth-3 arithmetic circuits with bounded top fan-in. In: Proceedings of the 23rd Annual CCC, pp. 280–291 (2008)

    Google Scholar 

  16. Kayal, N., Saraf, S.: Blackbox polynomial identity testing for depth 3 circuits. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 32 (2009)

    Google Scholar 

  17. Kayal, N., Saxena, N.: Polynomial identity testing for depth 3 circuits. Computational Complexity 16(2), 115–138 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  18. Lewin, D., Vadhan, S.: Checking polynomial identities over any field: Towards a derandomization? In: Proceedings of the 30th Annual STOC, pp. 428–437 (1998)

    Google Scholar 

  19. Lovasz, L.: On determinants, matchings, and random algorithms. In: Budach, L. (ed.) Fundamentals of Computing Theory. Akademia-Verlag (1979)

    Google Scholar 

  20. Mulmuley, K., Vazirani, U., Vazirani, V.: Matching is as easy as matrix inversion. Combinatorica 7(1), 105–113 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  21. Raz, R., Shpilka, A.: Deterministic polynomial identity testing in non commutative models. Computational Complexity 14(1), 1–19 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  22. Raz, R., Shpilka, A., Yehudayoff, A.: A lower bound for the size of syntactically multilinear arithmetic circuits. SIAM J. on Computing 38(4), 1624–1647 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  23. Saxena, N.: Diagonal circuit identity testing and lower bounds. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 60–71. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  24. Saxena, N., Seshadhri, C.: Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn’t matter. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 17 (2010)

    Google Scholar 

  25. Saraf, S., Volkovich, I.: Black-Box Identity Testing of Depth-4 Multilinear Circuits. In: Proceedings of the 43rd Annual STOC (2011)

    Google Scholar 

  26. Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. JACM 27(4), 701–717 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  27. Shpilka, A., Volkovich, I.: Improved polynomial identity testing for read-once formulas. In: APPROX-RANDOM, pp. 700–713 (2009)

    Google Scholar 

  28. Shpilka, A., Volkovich, I.: On the relation between polynomial identity testing and finding variable disjoint factors (2009) (submitted)

    Google Scholar 

  29. Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Symbolic and Algebraic Computation, pp. 216–226 (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science, Technion - Israel Institute of Technology, Haifa, Israel

    Amir Shpilka

Authors
  1. Amir Shpilka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Steklov Institute of Mathematics at St. Petersburg, 27 Fontanka, 191023, St.Petersburg, Russia

    Alexander Kulikov

  2. Department of Mathematical Logic and Theory of Algorithms, Moscow State University, Leninskie gory, 119991, Moscow, Russia

    Nikolay Vereshchagin

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shpilka, A. (2011). Recent Results on Polynomial Identity Testing. In: Kulikov, A., Vereshchagin, N. (eds) Computer Science – Theory and Applications. CSR 2011. Lecture Notes in Computer Science, vol 6651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20712-9_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20712-9_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20711-2

  • Online ISBN: 978-3-642-20712-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation