A unified method for multivariate polynomial factorizations
From MaRDI portal
Publication:689904
DOI10.1007/BF03167201zbMATH Open0796.12006OpenAlexW2042698719WikidataQ114233701 ScholiaQ114233701MaRDI QIDQ689904FDOQ689904
Authors: 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
Recommendations
Cites Work
- Factoring polynomials with rational coefficients
- Title not available (Why is that?)
- On Hensel factorization. I
- Approximate factorization of multivariate polynomials and absolute irreducibility testing
- Analysis of approximate factorization algorithm. I
- Factoring Multivariate Polynomials Over the Integers
- Factoring Polynomials Over Algebraic Number Fields
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Fast parallel absolute irreducibility testing
- Title not available (Why is that?)
Cited In (25)
- On multivariate polynomial matrix factorization problems
- A Unified Algorithm for Multivariate Analytic Factorization
- Extension of expansion base algorithm for multivariate analytic factorization including the case of singular leading coefficient
- Sharp precision in Hensel lifting for bivariate polynomial factorization
- Regularization and matrix computation in numerical polynomial algebra
- Topology and factorization of polynomials
- A study of approximate polynomials. I: Representation and arithmetic
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
- Title not available (Why is that?)
- Factoring polynomials over global fields
- A unified approach to evaluation algorithms for multivariate polynomials
- Approximate multivariate polynomial factorization based on zero-sum relations
- A new algorithm for computing the extended Hensel construction of multivariate polynomials
- Sparse bivariate polynomial factorization
- A Hybrid Approach for Normal Factorization of Polynomials
- Factorization of multivariate polynomials by extended Hensel construction
- Factoring polynomials and the knapsack problem
- Computing monodromy via continuation methods on random Riemann surfaces
- Approximate factorization of multivariate polynomials using singular value decomposition
- Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
- Lifting and recombination techniques for absolute factorization
- Improved dense multivariate polynomial factorization algorithms
- Solving multivariate algebraic equation by Hensel construction
- Title not available (Why is that?)
- Computation of simple and group factors of multivariate polynomials
This page was built for publication: A unified method for multivariate polynomial factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689904)