Improved dense multivariate polynomial factorization algorithms
From MaRDI portal
Publication:2457431
DOI10.1016/j.jsc.2007.01.003zbMath1127.13021OpenAlexW2066376457MaRDI QIDQ2457431
Publication date: 23 October 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2007.01.003
Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05)
Related Items
Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations, Lifting and recombination techniques for absolute factorization, Modular Las Vegas algorithms for polynomial absolute factorization, Factoring bivariate sparse (lacunary) polynomials, Factoring multivariate polynomials represented by black boxes: a Maple + C implementation, Fast separable factorization and applications, A concise proof of the Kronecker polynomial system solver from scratch, A note on Gao's algorithm for polynomial factorization, Algebraic osculation and application to factorization of sparse polynomials, Sparse bivariate polynomial factorization, A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\), New recombination algorithms for bivariate polynomial factorization based on Hensel lifting, Indecomposability of polynomials via Jacobian matrix, Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem, Towards toric absolute factorization, A recombination algorithm for the decomposition of multivariate rational functions, Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Théoremes de Bertini et applications
- Factoring sparse multivariate polynomials
- Fast parallel absolute irreducibility testing
- Irreducibility of multivariate polynomials
- Reducibility of polynomials \(f(x,y)\) modulo \(p\)
- Efficient matrix preconditioners for black box linear algebra
- Deterministic irreducibility testing of polynomials over large finite fields
- Effective Noether irreducibility forms and applications
- On Hensel factorization. I
- The probability to select the correct model using likelihood-ratio based criteria in choosing between two nested models of which the more extended one is true
- Deterministic distinct-degree factorization of polynomials over finite fields
- Sharp precision in Hensel lifting for bivariate polynomial factorization
- Effective Hilbert irreducibility
- Reduzibilität ebener Kurven.
- Factorization of Multivariate Polynomials Over Finite Fields
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Factoring Rational Polynomials over the Complex Numbers
- Bertini and his two fundamental theorems
- Complexity issues in bivariate polynomial factorization
- The truncated fourier transform and applications
- Factoring multivariate polynomials via partial differential equations
- Multivariate power series multiplication
- Absolute irreducibility of polynomials via Newton polytopes
