On Hensel factorization. I

Cited in

(64)

Computing the decomposition of primes p and p-adic absolute values in semi-simple algebras over \({\mathbb{Q}}\)
Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm
Massively parallel factorizations of polynomials with many non-commuting variables
Factoring Multivariate Polynomials over Algebraic Number Fields
A verified implementation of the Berlekamp-Zassenhaus factorization algorithm
Factoring Multivariate Polynomials over Large Finite Fields
Single-factor lifting and factorization of polynomials over local fields
Factorization patterns on nonlinear families of univariate polynomials over a finite field
Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
scientific article; zbMATH DE number 7564415 (Why is no real title available?)
A Remark on the Hensel Factorization Method
On the irreducibility of a class of polynomials. III
Computing sparse GCD of multivariate polynomials via polynomial interpolation
Constructive lifting in graded structures: A unified view of Buchberger and Hensel methods
Computing Galois groups over the rationals
Hensel lifting and bivariate polynomial factorisation over finite fields
Sharp precision in Hensel lifting for bivariate polynomial factorization
Factoring polynomials with rational coefficients
Factoring Polynomials Over Large Finite Fields
\(\sqrt{2}+\sqrt{3}\): Four different views
Symbolic iterative algorithm for generalized inversion of rational polynomial matrices
Massively parallel search for linear factors in polynomials with many variables
Algorithms related to the decomposition of polynomials
Factoring Multivariate Polynomials Over the Integers
Factoring bivariate sparse (lacunary) polynomials
Factoring polynomials over global fields
An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function
On algorithms to find \(p\)-ordering
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
Univariate polynomial factorization over finite fields
New Sparse Multivariate Polynomial Factorization Algorithms over Integers
Simplified High-Speed High-Distance List Decoding for Alternant Codes
On a Problem of Hasse
Factoring polynomials over finite fields: A survey
On the deterministic complexity of factoring polynomials
Complexity of solving parametric polynomial systems
An Inequality About Factors of Polynomials
Efficiently factoring polynomials modulo \(p^4\)
The history of the LLL-algorithm
scientific article; zbMATH DE number 3660789 (Why is no real title available?)
Hensel construction with an arbitrary degree of convergence
An Improved Multivariate Polynomial Factoring Algorithm
Factorization of polynomials given by arithmetic branching programs
Methodologies of Symbolic Computation
A unified method for multivariate polynomial factorizations
Factoring polynomials and the knapsack problem
A relative van Hoeij algorithm over number fields
Lifting and recombination techniques for absolute factorization
Approximate factorization of multivariate polynomials and absolute irreducibility testing
Deterministic irreducibility testing of polynomials over large finite fields
Improved dense multivariate polynomial factorization algorithms
Theory of computational complexity. Part 9. Transl. from the Russian.
On factoring parametric multivariate polynomials
Irreducibility of multivariate polynomials
A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\)
On the Periods of Generalized Fibonacci Recurrences
Products of polynomials and a priori estimates for coefficients in polynomial decompositions: A sharp result
The van Hoeij algorithm for factoring polynomials
Using the interval-symbol method with zero rewriting to factor polynomials over algebraic number fields
Solving polynomial systems over non-fields and applications to modular polynomial factoring
Proving an execution of an algorithm correct?
A new approach to the symbolic factorization of multivariate polynomials
Implicitization of hypersurfaces
A p-adic approach to the computation of Gröbner bases

This page was built for publication: On Hensel factorization. I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2537316)