Multivariate Polynomial Factorization

From MaRDI portal
Publication:4055074

DOI10.1145/321879.321890zbMath0301.65029OpenAlexW2024018487MaRDI QIDQ4055074

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



Related Items

Factoring sparse multivariate polynomials, Computing sparse GCD of multivariate polynomials via polynomial interpolation, Factoring multivariate polynomials via partial differential equations, An Improved Multivariate Polynomial Factoring Algorithm, Computer algebra: Past and future, Computation of simple and group factors of multivariate polynomials, Unnamed Item, A p-adic approach to the computation of Gröbner bases, Factorization ofm-D polynomials in linearm-D factors, Unnamed Item, Proving an execution of an algorithm correct?, Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators, Sparse bivariate polynomial factorization, 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, Theory of computational complexity. Part 9. Transl. from the Russian., Symbolic iterative algorithm for generalized inversion of rational polynomial matrices, Sharp precision in Hensel lifting for bivariate polynomial factorization, Algèbre linéaire sur $K[X_1,\dots,X_n$ et élimination], Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one, Computing Puiseux series: a fast divide and conquer algorithm, Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey, A general factorization method for multivariable polynomials, Hensel lifting and bivariate polynomial factorisation over finite fields