Fast Hensel's lifting implementation using partial fraction decomposition
type: Item
instance of: scholarly article
title: Fast Hensel's lifting implementation using partial fraction decomposition
zbMATH Open document ID: 0591.12001
DOI: 10.1016/0012-365X(85)90028-7
published in: Discrete Mathematics
publication date: 1985-01-01T00:00:00Z
review text: 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.
reviewed by: Joseph J. Liang
Mathematics Subject Classification ID: 12-04
Mathematics Subject Classification ID: 11R09
zbMATH DE Number: 3948407
zbMATH Keywords: computational number theory
zbMATH Keywords: partial fraction algorithm
zbMATH Keywords: polynomial factorization
author: D. Lugiez
MaRDI profile type: Publication
cites work: Q5598073
cites work: Q3668871
cites work: Fast Algorithms for Partial Fraction Decomposition
cites work: An Inequality About Factors of Polynomials
cites work: Q3735804
cites work: Q3882549
cites work: Q3758933
full work available at URL: 0012-365x(85)90028-7
OpenAlex ID: W2090446945
Recommended article: Parallel and cache-efficient Hensel lifting
Recommended article: Q4232508
Recommended article: Q3330498
Recommended article: Q4234216
Recommended article: Fast modular algorithms for squarefree factorization and Hermite integration
Recommended article: Q4240207
Recommended article: Q4232481
Recommended article: Fast Computation of Partial Fourier Transforms
Recommended article: Faster homomorphic linear transformations in HElib
Recommended article: A recursive algorithm for the incomplete partial fraction decomposition
description: scientific article; zbMATH DE number 3948407