Multivariate Polynomial Factorization
From MaRDI portal
Publication:4055074
DOI10.1145/321879.321890zbMATH Open0301.65029OpenAlexW2024018487MaRDI QIDQ4055074FDOQ4055074
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
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)
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- 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
- Title not available (Why is that?)
- Factoring sparse multivariate polynomials
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
- An Improved Multivariate Polynomial Factoring Algorithm
- Sparse bivariate polynomial factorization
- Computer algebra: Past and future
- Title not available (Why is that?)
- 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)
