Factoring sparse polynomials fast

DOI10.1016/J.JCO.2025.101934MaRDI QIDQ7006210zbMATH OpenFDO

Authors Aleksandr Viktorovich Demin, Joris van der Hoeven

Publication date 31 March 2025

Published in Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

factorizationsparse polynomialprobabilistic algorithmHensel liftingsparse interpolationgcd

Mathematics Subject Classification ID

Randomized algorithms (68W20) Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40) Polynomials, factorization in commutative rings (13P05)

This page was built for publication: Factoring sparse polynomials fast

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7006210)