Factoring multivariate polynomials via partial differential equations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1676636 (Why is no real title available?)
- scientific article; zbMATH DE number 3858405 (Why is no real title available?)
- scientific article; zbMATH DE number 4035950 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 66619 (Why is no real title available?)
- scientific article; zbMATH DE number 108109 (Why is no real title available?)
- scientific article; zbMATH DE number 3554399 (Why is no real title available?)
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 691468 (Why is no real title available?)
- scientific article; zbMATH DE number 799768 (Why is no real title available?)
- scientific article; zbMATH DE number 3893304 (Why is no real title available?)
- scientific article; zbMATH DE number 3265895 (Why is no real title available?)
- A New Algorithm for Factoring Polynomials Over Finite Fields
- A new efficient factorization algorithm for polynomials over small finite fields
- Absolute Factorization of Polynomials: A Geometric Approach
- 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
- An Improved Multivariate Polynomial Factoring Algorithm
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Compiler construction. 4th international conference, CC '92, Paderborn, Germany, October 5-7, 1992. Proceedings
- Computing Frobenius maps and factoring polynomials
- Computing the irreducible real factors and components of an algebraic curve
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Decomposition of polytopes and polynomials
- Effective Noether irreducibility forms and applications
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Factoring Polynomials Over Large Finite Fields
- Factoring Rational Polynomials over the Complex Numbers
- Factoring multivariate polynomials over finite fields
- Factoring polynomials via polytopes
- Factoring polynomials with rational coefficients
- Factoring sparse multivariate polynomials
- Factorization of Multivariate Polynomials Over Finite Fields
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fast multiplication of large numbers
- Hensel lifting and bivariate polynomial factorisation over finite fields
- Integration of rational functions: Rational computation of the logarithmic part
- Modern computer algebra
- Multivariate Polynomial Factorization
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On fast multiplication of polynomials over arbitrary algebras
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
- Reducibility of polynomials \(f(x,y)\) modulo \(p\)
- Reduzibilität ebener Kurven.
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
- Solving a Polynomial Equation: Some History and Recent Progress
- Solving linear equations over GF(2): Block Lanczos algorithm
- Solving sparse linear equations over finite fields
- Subquadratic-time factoring of polynomials over finite fields
Cited in
(60)- On the Sensitivity of Singular and Ill-Conditioned Linear Systems
- Derandomization and absolute reconstruction for sums of powers of linear forms
- Factoring bivariate polynomials using adjoints
- An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
- Factoring sparse polynomials fast
- An empirical study of cache-oblivious polygon indecomposability testing
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
- Factoring bivariate lacunary polynomials without heights
- Indecomposability of polynomials via Jacobian matrix
- Sharp precision in Hensel lifting for bivariate polynomial factorization
- Regularization and matrix computation in numerical polynomial algebra
- A note on the preconditioning for factorization of homogeneous polynomials
- Exact polynomial factorization by approximate high degree algebraic numbers
- Topology and factorization of polynomials
- A lifting and recombination algorithm for rational factorization of sparse polynomials
- Deterministic distinct-degree factorization of polynomials 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
- Irreducibility of Binomials
- Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond
- Towards toric absolute factorization
- Modular Las Vegas algorithms for polynomial absolute factorization
- On a generalization of Stickelberger's theorem
- Primary decomposition of zero-dimensional ideals over finite fields
- Families of polynomials and their specializations
- Normal projection: deterministic and probabilistic algorithms
- Pseudofactors of multivariate polynomials
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
- An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- New absolute irreducibility testing criteria and factorization of multivariate polynomials
- Improved explicit estimates on the number of solutions of equations over a finite field
- Complexity of solving parametric polynomial systems
- On the total order of reducibility of a pencil of algebraic plane curves
- Parallel methods for absolute irreducibility testing
- Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time
- Uniform bounds for the number of rational points on varieties over global fields
- Control of the non-geometrically integral reductions
- Nombre De Facteurs Absolument Irréductibles D'un Polynôme
- Sparse bivariate polynomial factorization
- A note on Gao's algorithm for polynomial factorization
- A unified method for multivariate polynomial factorizations
- Computing monodromy via continuation methods on random Riemann surfaces
- Irreducibility of polynomials modulo p via Newton polytopes.
- Bivariate factorization using a critical fiber
- Symbolic differentiation of factorized polynomials with repeated roots and the identification of their loci
- Multi-modular approach to polynomial-time factorization of bivariate integral polynomials
- Approximate factorization of multivariate polynomials using singular value decomposition
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
- Factoring polynomials over function fields
- Lifting and recombination techniques for absolute factorization
- Improved dense multivariate polynomial factorization algorithms
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
- Factorization in the multirefined tangent method
- Equivalence of polynomial identity testing and polynomial factorization
- On Bivariate Polynomial Factorization over Finite Fields
- A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\)
- A new absolute irreducibility criterion for multivariate polynomials over finite fields
- Optimal pseudorandom generators for low-degree polynomials over moderately large fields
- The numerical factorization of polynomials
This page was built for publication: Factoring multivariate polynomials via partial differential equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4794644)
