A unified method for multivariate polynomial factorizations
From MaRDI portal
Publication:689904
DOI10.1007/BF03167201zbMath0796.12006OpenAlexW2042698719WikidataQ114233701 ScholiaQ114233701MaRDI QIDQ689904
Tateaki Sasaki, Mutsuko Sasaki
Publication date: 29 September 1994
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03167201
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (11)
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring ⋮ Lifting and recombination techniques for absolute factorization ⋮ A study of approximate polynomials. I: Representation and arithmetic ⋮ Computing monodromy via continuation methods on random Riemann surfaces ⋮ Sparse bivariate polynomial factorization ⋮ A new algorithm for computing the extended Hensel construction of multivariate polynomials ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ Factoring polynomials and the knapsack problem ⋮ Sharp precision in Hensel lifting for bivariate polynomial factorization ⋮ Factoring polynomials over global fields ⋮ Solving multivariate algebraic equation by Hensel construction
Cites Work
- Unnamed Item
- Unnamed Item
- Fast parallel absolute irreducibility testing
- Factoring polynomials with rational coefficients
- Approximate factorization of multivariate polynomials and absolute irreducibility testing
- Analysis of approximate factorization algorithm. I
- On Hensel factorization. I
- Factoring Multivariate Polynomials Over the Integers
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Factoring Polynomials Over Algebraic Number Fields
This page was built for publication: A unified method for multivariate polynomial factorizations