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

DOI10.4230/LIPICS.MFCS.2016.47zbMath1398.11156arXiv1606.04592OpenAlexW2962794115MaRDI QIDQ4608609

Chris Umans, Anand Kumar Narayanan, Zeyu Guo

Publication date: 21 March 2018

Full work available at URL: https://arxiv.org/abs/1606.04592

zbMATH Keywords

complexityalgorithmsfinite fieldspolynomialsfactorization

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Factorization (11Y05)

Related Items (1)

Polynomial factorization over finite fields by computing Euler-Poincaré characteristics of Drinfeld modules

This page was built for publication: Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields