On Hensel factorization. I
From MaRDI portal
Publication:2537316
DOI10.1016/0022-314X(69)90047-XzbMath0188.33703OpenAlexW1982581232WikidataQ94974080 ScholiaQ94974080MaRDI QIDQ2537316
Publication date: 1969
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-314x(69)90047-x
Related Items
Computing sparse GCD of multivariate polynomials via polynomial interpolation, Irreducibility of multivariate polynomials, Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring, On algorithms to find \(p\)-ordering, Lifting and recombination techniques for absolute factorization, An Improved Multivariate Polynomial Factoring Algorithm, Computing the decomposition of primes p and p-adic absolute values in semi-simple algebras over \({\mathbb{Q}}\), A Remark on the Hensel Factorization Method, A relative van Hoeij algorithm over number fields, Massively parallel search for linear factors in polynomials with many variables, Unnamed Item, Constructive lifting in graded structures: A unified view of Buchberger and Hensel methods, A p-adic approach to the computation of Gröbner bases, Hensel construction with an arbitrary degree of convergence, Univariate polynomial factorization over finite fields, Factoring bivariate sparse (lacunary) polynomials, Massively parallel factorizations of polynomials with many non-commuting variables, An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function, New Sparse Multivariate Polynomial Factorization Algorithms over Integers, Proving an execution of an algorithm correct?, Methodologies of Symbolic Computation, On a Problem of Hasse, Single-factor lifting and factorization of polynomials over local fields, On factoring parametric multivariate polynomials, Factoring polynomials with rational coefficients, Approximate factorization of multivariate polynomials and absolute irreducibility testing, Improved dense multivariate polynomial factorization algorithms, Efficiently factoring polynomials modulo \(p^4\), Factoring Multivariate Polynomials over Algebraic Number Fields, A verified implementation of the Berlekamp-Zassenhaus factorization algorithm, Implicitization of hypersurfaces, A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\), Products of polynomials and a priori estimates for coefficients in polynomial decompositions: A sharp result, A unified method for multivariate polynomial factorizations, Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm, Factoring polynomials over finite fields: A survey, On the deterministic complexity of factoring polynomials, Factoring Polynomials Over Large Finite Fields, Complexity of solving parametric polynomial systems, Factoring polynomials and the knapsack problem, Theory of computational complexity. Part 9. Transl. from the Russian., Algorithms related to the decomposition of polynomials, On the Periods of Generalized Fibonacci Recurrences, A new approach to the symbolic factorization of multivariate polynomials, The History of the LLL-Algorithm, The van Hoeij Algorithm for Factoring Polynomials, Symbolic iterative algorithm for generalized inversion of rational polynomial matrices, Unnamed Item, Factoring Multivariate Polynomials over Large Finite Fields, Sharp precision in Hensel lifting for bivariate polynomial factorization, An Inequality About Factors of Polynomials, Factorization of polynomials given by arithmetic branching programs, Factorization patterns on nonlinear families of univariate polynomials over a finite field, Factoring Multivariate Polynomials Over the Integers, Simplified High-Speed High-Distance List Decoding for Alternant Codes, Deterministic irreducibility testing of polynomials over large finite fields, Factoring polynomials over global fields, \(\sqrt{2}+\sqrt{3}\): Four different views, On the irreducibility of a class of polynomials. III, Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots, Computing Galois groups over the rationals, Hensel lifting and bivariate polynomial factorisation over finite fields
Cites Work
