Document Open Access Logo

Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields

Authors Zeyu Guo, Anand Kumar Narayanan, Chris Umans

PDF
Thumbnail PDF

File

LIPIcs.MFCS.2016.47.pdf
  • Filesize: 0.53 MB
  • 14 pages

Document Identifiers

Author Details

Zeyu Guo
Anand Kumar Narayanan
Chris Umans

Cite AsGet BibTex

Zeyu Guo, Anand Kumar Narayanan, and Chris Umans. Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 47:1-47:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/LIPIcs.MFCS.2016.47

Abstract

The fastest known algorithm for factoring univariate polynomials over finite fields is the Kedlaya-Umans (fast modular composition) implementation of the Kaltofen-Shoup algorithm. It is randomized and takes ~O(n^{3/2}*log(q)+n*log^2(q)) time to factor polynomials of degree n over the finite field F_q with q elements. A significant open problem is if the 3/2 exponent can be improved. We study a collection of algebraic problems and establish a web of reductions between them. A consequence is that an algorithm for any one of these problems with exponent better than 3/2 would yield an algorithm for polynomial factorization with exponent better than 3/2.
Keywords
  • algorithms
  • complexity
  • finite fields
  • polynomials
  • factorization

Metrics

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

References

  1. A. Abboud, F. Grandoni, and V. V. Williams. Subcubic equivalences between graph centrality problems, APSP and diameter. In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1681-1697, 2015. Google Scholar
  2. A. Abboud and V. V. Williams. Popular conjectures imply strong lower bounds for dynamic problems. In Proceedings of the 55th Annual Symposium on Foundations of Computer Science, pages 434-443, 2014. Google Scholar
  3. A. Abboud, V. V. Williams, and O. Weimann. Consequences of faster alignment of sequences. In Automata, Languages, and Programming, pages 39-51, 2014. Google Scholar
  4. E. R. Berlekamp. Factoring polynomials over finite fields. Bell System Technical Journal, 46(8):1853-1859, 1967. Google Scholar
  5. D. G. Cantor and H. Zassenhaus. A new algorithm for factoring polynomials over finite fields. Mathematics of Computation, 36(154):587-592, 1981. Google Scholar
  6. L. Carlitz. On certain functions connected with polynomials in a Galois field. Duke Math. J., 1(2):137-168, 06 1935. Google Scholar
  7. L. Carlitz. A class of polynomials. Transactions of the American Mathematical Society, 43(2):167-182, 1938. Google Scholar
  8. K. Conrad. Carlitz extensions, available online at. URL: http://www.math.uconn.edu/~kconrad/blurbs/gradnumthy/carlitz.pdf.
  9. P. Erdős. On the normal number of prime factors of p-1 and some related problems concerning Euler’s ϕ-function. Quart. J. Math, 6:205-213, 1935. Google Scholar
  10. Z. Guo, A. K. Narayanan, and C. Umans. Algebraic problems equivalent to beating exponent 3/2 for polynomial factorization over finite fields. arXiv preprint arXiv:1606.04592, 2016. Google Scholar
  11. E. Kaltofen and A. Lobo. Factoring high-degree polynomials by the black box berlekamp algorithm. In Proceedings of the International Symposium on Symbolic and Algebraic Computation, pages 90-98, 1994. Google Scholar
  12. E. Kaltofen and V. Shoup. Subquadratic-time factoring of polynomials over finite fields. Mathematics of computation, 67(223):1179-1197, 1998. Google Scholar
  13. K. S. Kedlaya and C. Umans. Fast polynomial factorization and modular composition. SIAM J. Comput., 40(6):1767-1802, 2011. Google Scholar
  14. D. E. Knuth. The Art of Computer Programming, Volume 2 (3rd Ed.): Seminumerical Algorithms. Addison-Wesley, 1997. Google Scholar
  15. A. K. Narayanan. Polynomial factorization over finite fields by computing Euler-Poincare characteristics of Drinfeld modules. arXiv preprint arXiv:1504.07697, 2015. Google Scholar
  16. V. Pan. On computations with dense structured matrices. Mathematics of Computation, 55(191):179-190, 1990. Google Scholar
  17. M. Pǎtraşcu. Towards polynomial lower bounds for dynamic problems. In Proceedings of the 42nd ACM Symposium on Theory of Computing, pages 603-610, 2010. Google Scholar
  18. L. Roditty and U. Zwick. Replacement paths and k simple shortest paths in unweighted directed graphs. ACM Trans. Algorithms, 8(4):33:1-33:11, 2012. Google Scholar
  19. J. B. Rosser and L. Schoenfeld. Approximate formulas for some functions of prime numbers. Illinois J. Math., 6(1):64-94, 1962. Google Scholar
  20. V. Shoup. Efficient computation of minimal polynomials in algebraic extensions of finite fields. In Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, pages 53-58, 1999. Google Scholar
  21. J. Von Zur Gathen and V. Shoup. Computing frobenius maps and factoring polynomials. Computational complexity, 2(3):187-224, 1992. Google Scholar
  22. O. Weimann and R. Yuster. Replacement paths and distance sensitivity oracles via fast matrix multiplication. ACM Trans. Algorithms, 9(2):14:1-14:13, 2013. Google Scholar
  23. V. V. Williams. Faster replacement paths. In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1337-1346, 2011. Google Scholar
  24. V. V. Williams and R. Williams. Subcubic equivalences between path, matrix and triangle problems. In Proceedings of the 51st Annual Symposium on Foundations of Computer Science, pages 645-654, 2010. Google Scholar
  25. D. Y.Y. Yun. On square-free decomposition algorithms. In Proceedings of the 3rd ACM Symposium on Symbolic and Algebraic Computation, pages 26-35, 1976. 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 Imprint Privacy Contact