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.
Recommendations
- Parallel and cache-efficient Hensel lifting
- scientific article; zbMATH DE number 1262457
- scientific article; zbMATH DE number 3862429
- scientific article; zbMATH DE number 1263338
- Fast modular algorithms for squarefree factorization and Hermite integration
- scientific article; zbMATH DE number 1283877
- scientific article; zbMATH DE number 1262433
- Fast computation of partial Fourier transforms
- Faster homomorphic linear transformations in HElib
- A recursive algorithm for the incomplete partial fraction decomposition
Cites work
- An Inequality About Factors of Polynomials
- Fast Algorithms for Partial Fraction Decomposition
- scientific article; zbMATH DE number 3823145 (Why is no real title available?)
- scientific article; zbMATH DE number 3968703 (Why is no real title available?)
- scientific article; zbMATH DE number 4008513 (Why is no real title available?)
- scientific article; zbMATH DE number 3687497 (Why is no real title available?)
- scientific article; zbMATH DE number 3318360 (Why is no real title available?)
Cited in
(3)
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)