Hensel lifting and bivariate polynomial factorisation over finite fields

Authors:
Shuhong Gao;Alan G. B. Lauder
Affiliations:
Department of Mathematical Sciences, Clemson University, Clemson, SC;Mathematical Institute, Oxford University, Oxford OX1 3LB, United Kingdom
Venue:
Mathematics of Computation
Year:
2002

Citing 7
Cited 9

On fast multiplication of polynomials over arbitrary algebras

Acta Informatica
Algorithms for computer algebra

Algorithms for computer algebra
Subquadratic-time factoring of polynomials over finite fields

Mathematics of Computation
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors

Journal of the ACM (JACM)
Multivariate Polynomial Factorization

Journal of the ACM (JACM)
Random Polynomials and Polynomial Factorization

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Factoring univariate integral polynomial in polynomial average time

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation

Factoring multivariate polynomials via partial differential equations

Mathematics of Computation
Polynomial factorization: a success story

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Factoring polynomials via polytopes

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Counting reducible and singular bivariate polynomials

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
An efficient sparse adaptation of the polytope method over Fp and a record-high binary bivariate factorisation

Journal of Symbolic Computation
Deterministic distinct-degree factorization of polynomials over finite fields

Journal of Symbolic Computation
A note on Gao's algorithm for polynomial factorization

Theoretical Computer Science
Counting reducible, powerful, and relatively irreducible multivariate polynomials over finite fields

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Counting reducible and singular bivariate polynomials

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.