Fast Hensel's lifting implementation using partial fraction decomposition

From MaRDI portal





Based on Kung and Tong's partial fraction algorithm, the author developes an algorithm on polynomial factorization over the integers. It is claimed in the paper that this algorithm is more efficient than the usual Hensel lifting process.











This page was built for publication: Fast Hensel's lifting implementation using partial fraction decomposition

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