New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
From MaRDI portal
Publication:964741
DOI10.1007/s00200-010-0121-5zbMath1245.12008OpenAlexW1968680627MaRDI QIDQ964741
Publication date: 20 April 2010
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-010-0121-5
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)
Related Items
Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations, A lifting and recombination algorithm for rational factorization of sparse polynomials, Bivariate factorization using a critical fiber, Fast separable factorization and applications, A note on Gao's algorithm for polynomial factorization, Factoring bivariate polynomials using adjoints, Sparse bivariate polynomial factorization, Computing the multilinear factors of lacunary polynomials without heights, A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\), The numerical factorization of polynomials, Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring polynomials and the knapsack problem
- Factoring polynomials over global fields
- Effective Noether irreducibility forms and applications
- Fast separable factorization and applications
- Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic
- Improved dense multivariate polynomial factorization algorithms
- Hensel lifting and bivariate polynomial factorisation over finite fields
- Sharp precision in Hensel lifting for bivariate polynomial factorization
- Hensel and Newton Methods in Valuation Rings
- Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases
- Complexity issues in bivariate polynomial factorization
- Factoring multivariate polynomials via partial differential equations
- An Efficient Formula for Linear Recurrences
- Factoring Polynomials Over Large Finite Fields