The following pages link to On Hensel factorization. I (Q2537316):
Displaying 50 items.
- Single-factor lifting and factorization of polynomials over local fields (Q438687) (← links)
- Implicitization of hypersurfaces (Q504409) (← links)
- A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\) (Q509886) (← links)
- Symbolic iterative algorithm for generalized inversion of rational polynomial matrices (Q580902) (← links)
- A unified method for multivariate polynomial factorizations (Q689904) (← links)
- Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm (Q689905) (← links)
- Factoring polynomials and the knapsack problem (Q701105) (← links)
- On algorithms to find \(p\)-ordering (Q831740) (← links)
- Factoring bivariate sparse (lacunary) polynomials (Q883330) (← links)
- Factoring polynomials over global fields (Q1032662) (← links)
- Computing Galois groups over the rationals (Q1066947) (← links)
- Irreducibility of multivariate polynomials (Q1083191) (← links)
- Computing the decomposition of primes p and p-adic absolute values in semi-simple algebras over \({\mathbb{Q}}\) (Q1092109) (← links)
- Constructive lifting in graded structures: A unified view of Buchberger and Hensel methods (Q1117275) (← links)
- A p-adic approach to the computation of Gröbner bases (Q1118653) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Factoring polynomials with rational coefficients (Q1165896) (← links)
- Approximate factorization of multivariate polynomials and absolute irreducibility testing (Q1179781) (← links)
- Products of polynomials and a priori estimates for coefficients in polynomial decompositions: A sharp result (Q1198240) (← links)
- Algorithms related to the decomposition of polynomials (Q1224854) (← links)
- A new approach to the symbolic factorization of multivariate polynomials (Q1228373) (← links)
- \(\sqrt{2}+\sqrt{3}\): Four different views (Q1284617) (← links)
- Massively parallel search for linear factors in polynomials with many variables (Q1366832) (← links)
- Massively parallel factorizations of polynomials with many non-commuting variables (Q1392026) (← links)
- Computing sparse GCD of multivariate polynomials via polynomial interpolation (Q1621170) (← links)
- Deterministic irreducibility testing of polynomials over large finite fields (Q1825030) (← links)
- On the irreducibility of a class of polynomials. III (Q1838514) (← links)
- Hensel construction with an arbitrary degree of convergence (Q1922224) (← links)
- On factoring parametric multivariate polynomials (Q1958945) (← links)
- A verified implementation of the Berlekamp-Zassenhaus factorization algorithm (Q1984794) (← links)
- Factorization of polynomials given by arithmetic branching programs (Q2051373) (← links)
- Efficiently factoring polynomials modulo \(p^4\) (Q2229745) (← links)
- Complexity of solving parametric polynomial systems (Q2256707) (← links)
- Factorization patterns on nonlinear families of univariate polynomials over a finite field (Q2304196) (← links)
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots (Q2341619) (← links)
- Lifting and recombination techniques for absolute factorization (Q2371310) (← links)
- Improved dense multivariate polynomial factorization algorithms (Q2457431) (← links)
- Theory of computational complexity. Part 9. Transl. from the Russian. (Q2494566) (← links)
- A relative van Hoeij algorithm over number fields (Q2643532) (← links)
- Simplified High-Speed High-Distance List Decoding for Alternant Codes (Q3102792) (← links)
- Hensel lifting and bivariate polynomial factorisation over finite fields (Q3147180) (← links)
- Sharp precision in Hensel lifting for bivariate polynomial factorization (Q3377003) (← links)
- Factoring Multivariate Polynomials over Large Finite Fields (Q3478494) (← links)
- (Q3859255) (← links)
- An Inequality About Factors of Polynomials (Q4053736) (← links)
- Factoring Multivariate Polynomials Over the Integers (Q4068830) (← links)
- Factoring Multivariate Polynomials over Algebraic Number Fields (Q4100173) (← links)
- A Remark on the Hensel Factorization Method (Q4163606) (← links)
- An Improved Multivariate Polynomial Factoring Algorithm (Q4168687) (← links)
- On the Periods of Generalized Fibonacci Recurrences (Q4305958) (← links)
