Hensel lifting and bivariate polynomial factorisation over finite fields
From MaRDI portal
Publication:3147180
DOI10.1090/S0025-5718-01-01393-XzbMath1076.11064OpenAlexW2023238914MaRDI QIDQ3147180
Shuhong Gao, Alan G. B. Lauder
Publication date: 18 September 2002
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-01-01393-x
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Factorization (11Y05)
Related Items (8)
Factoring multivariate polynomials via partial differential equations ⋮ Deterministic distinct-degree factorization of polynomials over finite fields ⋮ Irreducibility of Binomials ⋮ A note on Gao's algorithm for polynomial factorization ⋮ Counting reducible and singular bivariate polynomials ⋮ New recombination algorithms for bivariate polynomial factorization based on Hensel lifting ⋮ An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation ⋮ Sharp precision in Hensel lifting for bivariate polynomial factorization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On fast multiplication of polynomials over arbitrary algebras
- Computing Frobenius maps and factoring polynomials
- On Hensel factorization. I
- Fast multiplication of large numbers
- Factoring Multivariate Polynomials over Large Finite Fields
- Multivariate Polynomial Factorization
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Subquadratic-time factoring of polynomials over finite fields
- The Arithmetic of Polynomials in a Galois Field
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
This page was built for publication: Hensel lifting and bivariate polynomial factorisation over finite fields