Multivariate Polynomial Factorization

DOI10.1145/321879.321890MaRDI QIDQ4055074zbMATH OpenOpenAlexFDO

Authors David R. Musser

Publication date 1975

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321879.321890

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to field theory (12-04)

Cited in

(24)

• Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
• Factoring Multivariate Polynomials over Algebraic Number Fields
• An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
• Algèbre linéaire sur $K[X_1,\dots,X_n]$ et élimination
• Factorization ofm-D polynomials in linearm-D factors
• Computing sparse GCD of multivariate polynomials via polynomial interpolation
• A general factorization method for multivariable polynomials
• Hensel lifting and bivariate polynomial factorisation over finite fields
• Sharp precision in Hensel lifting for bivariate polynomial factorization
• Symbolic iterative algorithm for generalized inversion of rational polynomial matrices
• Factoring multivariate polynomials via partial differential equations
• Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
• Factoring sparse multivariate polynomials
• scientific article; zbMATH DE number 3660789 (Why is no real title available?)
• Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
• Sparse bivariate polynomial factorization
• An Improved Multivariate Polynomial Factoring Algorithm
• Computer algebra: Past and future
• scientific article; zbMATH DE number 3687497 (Why is no real title available?)
• Theory of computational complexity. Part 9. Transl. from the Russian.
• Computing Puiseux series: a fast divide and conquer algorithm
• Computation of simple and group factors of multivariate polynomials
• Proving an execution of an algorithm correct?
• A p-adic approach to the computation of Gröbner bases

This page was built for publication: Multivariate Polynomial Factorization

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