Factoring multivariate polynomials via partial differential equations

DOI10.1090/S0025-5718-02-01428-XzbMath1052.12006MaRDI QIDQ4794644

Shuhong Gao

Publication date: 19 February 2003

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

polynomial factorizationpartial differential equationsabsolute irreducibilityHilbert irreducibility theorem

Mathematics Subject Classification ID

Related Items (44)

Derandomization and absolute reconstruction for sums of powers of linear forms ⋮ Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring ⋮ Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations ⋮ Lifting and recombination techniques for absolute factorization ⋮ Families of polynomials and their specializations ⋮ Deterministic distinct-degree factorization of polynomials over finite fields ⋮ Modular Las Vegas algorithms for polynomial absolute factorization ⋮ On a generalization of Stickelberger's theorem ⋮ A lifting and recombination algorithm for rational factorization of sparse polynomials ⋮ Bivariate factorization using a critical fiber ⋮ Irreducibility of Binomials ⋮ Irreducibility of polynomials modulo \(p\) via Newton polytopes. ⋮ Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond ⋮ Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time ⋮ Computing monodromy via continuation methods on random Riemann surfaces ⋮ A note on Gao's algorithm for polynomial factorization ⋮ Nombre De Facteurs Absolument Irréductibles D'un Polynôme ⋮ Sparse bivariate polynomial factorization ⋮ An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain ⋮ On the total order of reducibility of a pencil of algebraic plane curves ⋮ Improved dense multivariate polynomial factorization algorithms ⋮ A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\) ⋮ The numerical factorization of polynomials ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ New recombination algorithms for bivariate polynomial factorization based on Hensel lifting ⋮ An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation ⋮ Approximate factorization of multivariate polynomials using singular value decomposition ⋮ Complexity of solving parametric polynomial systems ⋮ Normal projection: deterministic and probabilistic algorithms ⋮ Improved explicit estimates on the number of solutions of equations over a finite field ⋮ An empirical study of cache-oblivious polygon indecomposability testing ⋮ Indecomposability of polynomials via Jacobian matrix ⋮ Primary decomposition of zero-dimensional ideals over finite fields ⋮ Efficient \(q\)-integer linear decomposition of multivariate polynomials ⋮ The computation of the greatest common divisor of three bivariate Bernstein polynomials defined in a rectangular domain ⋮ Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem ⋮ Parallel methods for absolute irreducibility testing ⋮ Sharp precision in Hensel lifting for bivariate polynomial factorization ⋮ On the Sensitivity of Singular and Ill-Conditioned Linear Systems ⋮ Towards toric absolute factorization ⋮ Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots ⋮ Uniform bounds for the number of rational points on varieties over global fields ⋮ Equivalence of polynomial identity testing and polynomial factorization ⋮ Control of the non-geometrically integral reductions

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
• Integration of rational functions: Rational computation of the logarithmic part
• Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
• Factoring multivariate polynomials over finite fields
• Factoring sparse multivariate polynomials
• Factoring polynomials with rational coefficients
• On fast multiplication of polynomials over arbitrary algebras
• Advances in Cryptology - CRYPTO '90. A conference on the theory and application of Cryptography, Univ. of California, Santa Barbara, USA, August 11--15, 1990. Proceedings
• Reducibility of polynomials \(f(x,y)\) modulo \(p\)
• Solving linear equations over GF(2): Block Lanczos algorithm
• Computing the irreducible real factors and components of an algebraic curve
• Effective Noether irreducibility forms and applications
• Computing Frobenius maps and factoring polynomials
• A new efficient factorization algorithm for polynomials over small finite fields
• Compiler construction. 4th international conference, CC '92, Paderborn, Germany, October 5-7, 1992. Proceedings
• Fast multiplication of large numbers
• Hensel lifting and bivariate polynomial factorisation over finite fields
• Absolute Factorization of Polynomials: A Geometric Approach
• Reduzibilität ebener Kurven.
• Factorization of Multivariate Polynomials Over Finite Fields
• Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
• Solving sparse linear equations over finite fields
• Factoring Multivariate Polynomials over Algebraic Number Fields
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Factoring Rational Polynomials over the Complex Numbers
• Multivariate Polynomial Factorization
• An Improved Multivariate Polynomial Factoring Algorithm
• Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
• Solving a Polynomial Equation: Some History and Recent Progress
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Subquadratic-time factoring of polynomials over finite fields
• Factoring polynomials via polytopes
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• Factoring Polynomials Over Large Finite Fields
• Decomposition of polytopes and polynomials

This page was built for publication: Factoring multivariate polynomials via partial differential equations