Document Open Access Logo

Arithmetic Circuit Complexity of Division and Truncation

Authors Pranjal Dutta, Gorav Jindal, Anurag Pandey, Amit Sinhababu

Thumbnail PDF


  • Filesize: 0.99 MB
  • 36 pages

Document Identifiers

Author Details

Pranjal Dutta
  • Chennai Mathematical Institute, India
Gorav Jindal
  • Institut für Mathematik, Technische Universität Berlin, Germany
Anurag Pandey
  • Saarland University, Saarland Informatics Campus, Saarbrücken, Germany
Amit Sinhababu
  • Aalen University, Germany


We thank Himanshu Shukla for several discussions on the complexity of truncated power series, and for bringing the reference [Coons and Borwein, 2008] to our attention. P. D. would like to thank CSE, IIT Kanpur for the hospitality. A. S. would like to thank the Institute of Theoretical Computer Science at Ulm University for the hospitality. We thank Thomas Thierauf and Nitin Saxena for discussions and feedback on the draft.

Cite AsGet BibTex

Pranjal Dutta, Gorav Jindal, Anurag Pandey, and Amit Sinhababu. Arithmetic Circuit Complexity of Division and Truncation. In 36th Computational Complexity Conference (CCC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 200, pp. 25:1-25:36, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)


Given polynomials f,g,h ∈ 𝔽[x₁,…,x_n] such that f = g/h, where both g and h are computable by arithmetic circuits of size s, we show that f can be computed by a circuit of size poly(s,deg(h)). This solves a special case of division elimination for high-degree circuits (Kaltofen'87 & WACT'16). The result is an exponential improvement over Strassen’s classic result (Strassen'73) when deg(h) is poly(s) and deg(f) is exp(s), since the latter gives an upper bound of poly(s, deg(f)). Further, we show that any univariate polynomial family (f_d)_d, defined by the initial segment of the power series expansion of rational function g_d(x)/h_d(x) up to degree d (i.e. f_d = g_d/h_d od x^{d+1}), where circuit size of g is s_d and degree of g_d is at most d, can be computed by a circuit of size poly(s_d,deg(h_d),log d). We also show a hardness result when the degrees of the rational functions are high (i.e. Ω (d)), assuming hardness of the integer factorization problem. Finally, we extend this conditional hardness to simple algebraic functions as well, and show that for every prime p, there is an integral algebraic power series with its minimal polynomial satisfying a degree p polynomial equation, such that its initial segment is hard to compute unless integer factoring is easy, or a multiple of n! is easy to compute. Both, integer factoring and computation of multiple of n!, are believed to be notoriously hard. In contrast, we show examples of transcendental power series whose initial segments are easy to compute.

Subject Classification

ACM Subject Classification
  • Theory of computation → Algebraic complexity theory
  • Theory of computation → Computational complexity and cryptography
  • Arithmetic Circuits
  • Division
  • Truncation
  • Division elimination
  • Rational function
  • Algebraic power series
  • Transcendental power series
  • Integer factorization


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Alexander Alder. Grenzrang und Grenzkomplexität aus algebraischer und topologischer Sicht. PhD thesis, Zentralstelle der Studentenschaft, 1984. Google Scholar
  2. Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, and Peter Miltersen. On the Complexity of Numerical Analysis. SIAM Journal on Computing, 38, January 2006. Preliminary version in the 21^st Annual IEEE Conference on Computational Complexity (CCC'06). URL:
  3. Robert Andrews. Algebraic Hardness Versus Randomness in Low Characteristic. In 35th Computational Complexity Conference (CCC 2020), volume 169 of Leibniz International Proceedings in Informatics (LIPIcs), pages 37:1-37:32. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2020. URL:
  4. Jean Berstel and Christophe Reutenauer. Rational Series and Their Languages. Springer-Verlag, Berlin, Heidelberg, 1988. URL:
  5. Markus Bläser and Gorav Jindal. On the Complexity of Symmetric Polynomials. In 10^th Innovations in Theoretical Computer Science Conference (ITCS'19), volume 124 of LIPIcs, pages 47:1-47:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL:
  6. Alin Bostan, Gilles Christol, and Philippe Dumas. Fast computation of the Nth term of an algebraic series over a finite prime field. In Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (ISSAC'16), pages 119-126, 2016. URL:
  7. Karl Bringmann, Christian Ikenmeyer, and Jeroen Zuiddam. On Algebraic Branching Programs of Small Width. J. ACM, 65(5):1-29, 2018. (Preliminary version in the 32^nd Computational Complexity Conference (CCC'17). URL:
  8. Peter Bürgisser. The complexity of factors of multivariate polynomials. Foundations of Computational Mathematics, 4(4):369-396, 2004. URL:
  9. Peter Bürgisser. On defining integers and proving arithmetic circuit lower bounds. Computational Complexity, 18(1):81-103, 2009. URL:
  10. Peter Bürgisser, Michael Clausen, and Amin Shokrollahi. Algebraic complexity theory, volume 315. Springer Science & Business Media, 2013. Google Scholar
  11. David V Chudnovsky and Gregory V Chudnovsky. On expansion of algebraic functions in power and Puiseux series, I. Journal of Complexity, 2(4):271-294, 1986. URL:
  12. Michael Coons. The Transcendence of Series Related to Stern’s Diatomic Sequence. International Journal of Number Theory, 06, November 2011. URL:
  13. Michael Coons and Peter Borwein. Transcendence of power series for some number theoretic functions. Proceedings of the American Mathematical Society, 137, July 2008. URL:
  14. Wellington De Melo and Benar Fux Svaiter. The cost of computing integers. Proceedings-American Mathematical Society, 124:1377-1378, 1996. URL:
  15. Richard A. Demillo and Richard J. Lipton. A probabilistic remark on algebraic program testing. Information Processing Letters, 7(4):193-195, 1978. URL:
  16. Pranjal Dutta. Real tau-Conjecture for sum-of-squares: A unified approach to lower bound and derandomization. In 16th International Computer Science Symposium in Russia (CSR 2021), 2021. URL:
  17. Pranjal Dutta, Nitin Saxena, and Amit Sinhababu. Discovering the roots: Uniform closure results for algebraic classes under factoring. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pages 1152-1165, 2018. URL:
  18. Pranjal Dutta, Nitin Saxena, and Thomas Thierauf. A Largish Sum-Of-Squares Implies Circuit Hardness and Derandomization. In 12th Innovations in Theoretical Computer Science Conference (ITCS 2021), volume 185 of Leibniz International Proceedings in Informatics (LIPIcs), pages 23:1-23:21. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2021. URL: 10.4230/LIPIcs.ITCS.2021.23.
  19. Joshua A Grochow et al. Complexity in ideals of polynomials: questions on algebraic complexity of circuits and proofs. Bulletin of EATCS, 2(130), 2020. URL:
  20. Joshua A. Grochow, Ketan D. Mulmuley, and Youming Qiao. Boundaries of VP and VNP. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), volume 55, pages 34:1-34:14, 2016. URL:
  21. Gorav Jindal. On approximate polynomial identity testing and real root finding. PhD thesis, Saarland University, 2019. URL:
  22. Erich Kaltofen. Uniform closure properties of p-computable functions. In Proceedings of the eighteenth annual ACM symposium on Theory of computing, pages 330-337, 1986. URL:
  23. Erich Kaltofen. Single-factor Hensel lifting and its application to the straight-line complexity of certain polynomials. In Proceedings of the 19^th annual ACM symposium on Theory of computing (STOC'87), pages 443-452, 1987. URL:
  24. Pascal Koiran. Valiant’s model and the cost of computing integers. computational complexity, 13(3):131-146, 2005. Google Scholar
  25. Pascal Koiran. Shallow circuits with high-powered inputs. Innovations in Computer Science (ICS), 2011. URL:
  26. Pascal Koiran and Sylvain Perifel. Interpolation in Valiant’s theory. Computational Complexity, 20(1):1-20, 2011. URL:
  27. Pascal Koiran, Natacha Portier, Sébastien Tavenas, and Stéphan Thomassé. A τ-Conjecture for Newton Polygons. Foundations of computational mathematics, 15(1):185-197, 2015. URL:
  28. FV Kuhlmann. On convergent power series, 1996. URL:
  29. Hsiang Kung and Joseph Traub. All Algebraic Functions Can Be Computed Fast. J. ACM, 25:245-260, April 1978. URL:
  30. Dick Lipton and Ken Regan. Factoring and factorials, February 2009. URL:
  31. Richard J Lipton. Polynomials with 0-1 coefficients that are hard to evaluate. SIAM Journal on Computing, 7(1):61-69, 1978. Preliminary version in the 16^th Annual Symposium on Foundations of Computer Science (FOCS 1975). URL:
  32. Richard J Lipton. Straight-line complexity and integer factorization. In International Algorithmic Number Theory Symposium (ANTS 94), pages 71-79. Springer, 1994. URL:
  33. Richard J Lipton and Larry J Stockmeyer. Evaluation of polynomials with super-preconditioning. Journal of Computer and System Sciences, 16(2):124-139, 1978. URL:
  34. Meena Mahajan. Algebraic Complexity Classes. In Perspectives in Computational Complexity, pages 51-75. Springer, 2014. URL:
  35. Carlos Moreira. On asymptotic estimates for arithmetic cost functions. Proceedings of the American Mathematical Society, 125(2):347-353, 1997. URL:
  36. Ketan D Mulmuley. The GCT program toward the P vs. NP problem. Communications of the ACM, 55(6):98-107, 2012. URL:
  37. Danny Nguyen and Igor Pak. Complexity of short generating functions. In Forum of Mathematics, Sigma, volume 6. Cambridge University Press, 2018. URL:
  38. Øystein Ore. Über höhere kongruenzen. Norsk Mat. Forenings Skrifter, 1(7):15, 1922. Google Scholar
  39. Igor Pak. Complexity problems in enumerative combinatorics. In Proceedings of the International Congress of Mathematicians - Rio de Janeiro 2018. Vol. IV. Invited lectures, pages 3153-3180. World Sci. Publ., Hackensack, NJ, 2018. URL:
  40. David A Plaisted. New NP-hard and NP-complete polynomial and integer divisibility problems. Theoretical Computer Science, 31(1-2):125-138, 1984. Preliminary in the 17^th Annual Symposium on Foundations of Computer Science (FOCS 1976). URL:
  41. Jacob T Schwartz. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM (JACM), 27(4):701-717, 1980. URL:
  42. Adi Shamir. Factoring numbers in O (logn) arithmetic steps. Information Processing Letters, 8(1):28-31, 1979. URL:
  43. Amir Shpilka and Amir Yehudayoff. Arithmetic Circuits: A survey of recent results and open questions. Foundations and Trendsregistered in Theoretical Computer Science, 5(3-4):207-388, 2010. URL:
  44. Michael Shub and Steve Smale. On the intractability of Hilbert’s Nullstellensatz and an algebraic version of "NP ̸ = P?". Duke Math. J., 81(1):47-54 (1996), 1995. A celebration of John F. Nash, Jr. URL:
  45. Volker Strassen. Vermeidung von divisionen. Journal für die reine und angewandte Mathematik, 264:184-202, 1973. Google Scholar
  46. L Valiant. Reducibility by algebraic projections in: Logic and algorithmic. In Symposium in honour of Ernst Specker, pages 365-380, 1982. Google Scholar
  47. Leslie G Valiant. Completeness classes in algebra. In Proceedings of the 11th Annual ACM symposium on Theory of computing, pages 249-261. ACM, 1979. URL:
  48. Joachim Von Zur Gathen and Jürgen Gerhard. Modern computer algebra. Cambridge university press, 2013. Google Scholar
  49. Wact. Some Accessible Open Problems. Workshop on Algebraic Complexity Theory (WACT 2016). URL:
  50. Klaus W Wagner. The complexity of combinatorial problems with succinct input representation. Acta informatica, 23(3):325-356, 1986. URL:
  51. Richard Zippel. Probabilistic Algorithms for Sparse Polynomials. In Proceedings of the International Symposium on Symbolic and Algebraic Computation, EUROSAM '79, pages 216-226, 1979. URL:
  52. J.von zur Gathen and V. Strassen. Some polynomials that are hard to compute. Theoretical Computer Science, 11(3):331-335, 1980. URL:
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail