Document Open Access Logo

Derandomizing Multivariate Polynomial Factoring for Low Degree Factors

Authors Pranjal Dutta , Amit Sinhababu, Thomas Thierauf

PDF
Thumbnail PDF

File

LIPIcs.APPROX-RANDOM.2024.75.pdf
  • Filesize: 0.92 MB
  • 20 pages

Document Identifiers

Author Details

Pranjal Dutta
  • School of Computing, National University of Singapore, Singapore
Amit Sinhababu
  • Chennai Mathematical Institute, Chennai, India
Thomas Thierauf
  • Ulm University, Germany

Funding

  • Dutta, Pranjal: Funded by the project "Foundation of Lattice-based Cryptography", by NUS-NCS Joint Laboratory for Cyber Security.
  • Thierauf, Thomas: Supported by DFG grant TH 472/5-2.

Cite As Get BibTex

Pranjal Dutta, Amit Sinhababu, and Thomas Thierauf. Derandomizing Multivariate Polynomial Factoring for Low Degree Factors. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 317, pp. 75:1-75:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.75

Abstract

Kaltofen [STOC 1986] gave a randomized algorithm to factor multivariate polynomials given by algebraic circuits. We derandomize the algorithm in some special cases.
For an n-variate polynomial f of degree d from a class 𝒞 of algebraic circuits, we design a deterministic algorithm to find all its irreducible factors of degree ≤ δ, for constant δ. The running time of this algorithm stems from a deterministic PIT algorithm for class 𝒞 and a deterministic algorithm that tests divisibility of f by a polynomial of degree ≤ δ. 
By using the PIT algorithm for constant-depth circuits by Limaye, Srinivasan and Tavenas [FOCS 2021] and the divisibility results by Forbes [FOCS 2015], this generalizes and simplifies a recent result by Kumar, Ramanathan and Saptharishi [SODA 2024]. They designed a subexponential-time algorithm that, given a blackbox access to f computed by a constant-depth circuit, outputs its irreducible factors of degree ≤ δ. When the input f is sparse, the time complexity of our algorithm depends on a whitebox PIT algorithm for ∑_i m_i g_i^{d_i}, where m_i are monomials and deg(g_i) ≤ δ. All the previous algorithms required a blackbox PIT algorithm for the same class.
Our second main result considers polynomials f, where each irreducible factor has degree at most δ. We show that all the irreducible factors with their multiplicities can be computed in polynomial time with blackbox access to f.
Finally, we consider factorization of sparse polynomials. We show that in order to compute all the sparse irreducible factors efficiently, it suffices to derandomize irreducibility preserving bivariate projections for sparse polynomials.

Subject Classification

ACM Subject Classification
  • Theory of computation → Algebraic complexity theory
  • Computing methodologies → Algebraic algorithms
Keywords
  • algebraic complexity
  • factoring
  • low degree
  • weight isolation
  • divisibility

Metrics

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

References

  1. Sanjeev Arora and Madhu Sudan. Improved low-degree testing and its applications. Combinatorica, 3(23), 2003. Google Scholar
  2. Elwyn R Berlekamp. Factoring polynomials over large finite fields. Mathematics of computation, 24(111):713-735, 1970. Google Scholar
  3. Vishwas Bhargava, Shubhangi Saraf, and Ilya Volkovich. Deterministic factorization of sparse polynomials with bounded individual degree. Journal of the ACM (JACM), 67(2):1-28, 2020. Google Scholar
  4. Pranav Bisht and Ilya Volkovich. On solving sparse polynomial factorization related problems. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Schloss-Dagstuhl - Leibniz-Zentrum für Informatik, 2022. Google Scholar
  5. Markus Bläser and Anurag Pandey. Polynomial identity testing for low degree polynomials with optimal randomness. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. Google Scholar
  6. Andrej Bogdanov. Pseudorandom generators for low degree polynomials. In Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pages 21-30, 2005. Google Scholar
  7. Nader Bshouty. Testers and their applications. In Proceedings of the 5th conference on Innovations in theoretical computer science, pages 327-352, 2014. Google Scholar
  8. Ashish Dwivedi, Zeyu Guo, and Ben Lee Volk. Optimal pseudorandom generators for low-degree polynomials over moderately large fields. arXiv preprint, 2024. URL: https://arxiv.org/abs/2402.11915.
  9. Michael A Forbes. Deterministic divisibility testing via shifted partial derivatives. In 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pages 451-465. IEEE, 2015. Google Scholar
  10. Michael A Forbes, Ramprasad Saptharishi, and Amir Shpilka. Hitting sets for multilinear read-once algebraic branching programs, in any order. In Proceedings of the forty-sixth annual ACM symposium on Theory of computing, pages 867-875, 2014. Google Scholar
  11. Zeyu Guo and Rohit Gurjar. Improved explicit hitting-sets for roabps. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2020. Google Scholar
  12. Ankit Gupta. Algebraic geometric techniques for depth-4 pit & sylvester-gallai conjectures for varieties. In Electronic Colloquium on Computational Complexity (ECCC), volume 21, 2014. Google Scholar
  13. Rohit Gurjar, Arpita Korwar, Nitin Saxena, and Thomas Thierauf. Deterministic identity testing for sum of read-once oblivious arithmetic branching programs. computational complexity, 26:835-880, 2017. Google Scholar
  14. Ming-Deh Huang and Yiu-Chung Wong. Extended hilbert irreducibility and its applications. Journal of Algorithms, 37(1):121-145, 2000. Google Scholar
  15. Valentine Kabanets and Russell Impagliazzo. Derandomizing polynomial identity tests means proving circuit lower bounds. In Proceedings of the 35th ACM Symposium on Theory of Computing (STOC), pages 355-364. ACM, 2003. Google Scholar
  16. Erich Kaltofen. Computing with polynomials given by straight-line programs I: greatest common divisors. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing, May 6-8, 1985, Providence, Rhode Island, USA, pages 131-142, 1985. Google Scholar
  17. Erich Kaltofen. Effective hilbert irreducibility. Information and Control, 66(3):123-137, 1985. Google Scholar
  18. Erich Kaltofen. Polynomial-time reductions from multivariate to bi-and univariate integral polynomial factorization. SIAM Journal on Computing, 14(2):469-489, 1985. Google Scholar
  19. Erich Kaltofen. Factorization of polynomials given by straight-line programs. Randomness and Computation, 5:375-412, 1989. Google Scholar
  20. Erich Kaltofen. Effective noether irreducibility forms and applications. Journal of Computer and System Sciences, 50(2):274-295, 1995. Google Scholar
  21. Erich Kaltofen and Barry M. Trager. Computing with polynomials given byblack boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators. Journal of Symbolic Computation, 9(3):301-320, 1990. Google Scholar
  22. Neeraj Kayal. Efficient algorithms for some special cases of the polynomial equivalence problem. In Dana Randall, editor, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011, pages 1409-1421. SIAM, 2011. URL: https://doi.org/10.1137/1.9781611973082.108.
  23. Neeraj Kayal. Affine projections of polynomials. In Proceedings of the forty-fourth annual ACM symposium on Theory of computing, pages 643-662, 2012. Google Scholar
  24. Adam R Klivans and Daniel Spielman. Randomness efficient identity testing of multivariate polynomials. In Proceedings of the thirty-third annual ACM symposium on Theory of computing, pages 216-223, 2001. Google Scholar
  25. Pascal Koiran and Nicolas Ressayre. Orbits of monomials and factorization into products of linear forms. arXiv preprint, 2018. URL: https://arxiv.org/abs/1807.03663.
  26. Pascal Koiran and Mateusz Skomra. Derandomization and absolute reconstruction for sums of powers of linear forms. Theoretical Computer Science, 887:63-84, 2021. Google Scholar
  27. Swastik Kopparty, Shubhangi Saraf, and Amir Shpilka. Equivalence of polynomial identity testing and polynomial factorization. computational complexity, 24(2):295-331, 2015. Google Scholar
  28. Mrinal Kumar, Varun Ramanathan, and Ramprasad Saptharishi. Deterministic algorithms for low degree factors of constant depth circuits. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 3901-3918. SIAM, 2024. Google Scholar
  29. Mrinal Kumar, Varun Ramanathan, Ramprasad Saptharishi, and Ben Lee Volk. Towards deterministic algorithms for constant-depth factors of constant-depth circuits. arXiv preprint, 2024. URL: https://arxiv.org/abs/2403.01965.
  30. Arjen K Lenstra, Hendrik Willem Lenstra, and László Lovász. Factoring polynomials with rational coefficients. Mathematische annalen, 261:515-534, 1982. Google Scholar
  31. Nutan Limaye, Srikanth Srinivasan, and Sébastien Tavenas. Superpolynomial lower bounds against low-depth algebraic circuits. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pages 804-814. IEEE, 2021. Google Scholar
  32. Dori Medini and Amir Shpilka. Hitting sets and reconstruction for dense orbits in vp_xxx VERBATIM x PLACEHOLDER xxx 1433-3 xxx REDLOHECALP x MITABREV xxxe and σπσ circuits. In 36th Computational Complexity Conference (CCC 2021). Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2021. Google Scholar
  33. C Ramya and BV Raghavendra Rao. Linear projections of the vandermonde polynomial. Theoretical Computer Science, 795:165-182, 2019. Google Scholar
  34. Ran Raz and Amir Shpilka. Deterministic polynomial identity testing in non-commutative models. computational complexity, 14:1-19, 2005. Google Scholar
  35. Nitin Saxena. Diagonal circuit identity testing and lower bounds. In Automata, Languages and Programming: 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I 35, pages 60-71. Springer, 2008. Google Scholar
  36. Amir Shpilka. Interpolation of depth-3 arithmetic circuits with two multiplication gates. In Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pages 284-293, 2007. Google Scholar
  37. Gaurav Sinha. Reconstruction of real depth-3 circuits with top fan-in 2. In 31st Conference on Computational Complexity (CCC 2016). Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2016. Google Scholar
  38. Volker Strassen. Vermeidung von divisionen. Journal für die reine und angewandte Mathematik, 264:184-202, 1973. Google Scholar
  39. Ilya Volkovich. Deterministically factoring sparse polynomials into multilinear factors and sums of univariate polynomials. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. Google Scholar
  40. Ilya Volkovich. On some computations on sparse polynomials. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. Google Scholar
  41. Joachim von zur Gathen and Erich Kaltofen. Factoring sparse multivariate polynomials. Journal of Computer and System Sciences, 31(2):265-287, 1985. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact