Hensel lifting and bivariate polynomial factorisation over finite fields
DOI10.1090/S0025-5718-01-01393-XzbMATH Open1076.11064OpenAlexW2023238914MaRDI QIDQ3147180FDOQ3147180
Authors: 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
Recommendations
- scientific article; zbMATH DE number 1262433
- Sharp precision in Hensel lifting for bivariate polynomial factorization
- Complexity issues in bivariate polynomial factorization
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
- scientific article; zbMATH DE number 1881584
Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- On fast multiplication of polynomials over arbitrary algebras
- Fast multiplication of large numbers
- Title not available (Why is that?)
- Computing Frobenius maps and factoring polynomials
- Subquadratic-time factoring of polynomials over finite fields
- On Hensel factorization. I
- Multivariate Polynomial Factorization
- The Arithmetic of Polynomials in a Galois Field
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Title not available (Why is that?)
- Factoring Multivariate Polynomials over Large Finite Fields
- Title not available (Why is that?)
Cited In (10)
- 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
- Deterministic distinct-degree factorization of polynomials over finite fields
- Factoring multivariate polynomials via partial differential equations
- Counting reducible and singular bivariate polynomials
- Irreducibility of Binomials
- Linear Hensel lifting for \(\mathbb{F}_p[x,y]\) and \(\mathbb{Z}[x]\) with cubic cost
- A note on Gao's algorithm for polynomial factorization
- Parallel and cache-efficient Hensel lifting
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
This page was built for publication: Hensel lifting and bivariate polynomial factorisation over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147180)
