Sciweavers

MOC
2002

Hensel lifting and bivariate polynomial factorisation over finite fields

13 years 11 months ago
Hensel lifting and bivariate polynomial factorisation over finite fields
This paper presents an average time analysis of a Hensel lifting based factorisation algorithm for bivariate polynomials over finite fields. It is shown that the average running time is almost linear in the input size. This explains why the Hensel lifting technique is fast in practice for most polynomials.
Shuhong Gao, Alan G. B. Lauder
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 2002
Where MOC
Authors Shuhong Gao, Alan G. B. Lauder
Comments (0)