Pages that link to "Item:Q4794644"

The following pages link to Factoring multivariate polynomials via partial differential equations (Q4794644):

Displaying 48 items.

• Families of polynomials and their specializations (Q311487) (← links)
• Sparse bivariate polynomial factorization (Q477285) (← links)
• A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\) (Q509886) (← links)
• The numerical factorization of polynomials (Q525605) (← links)
• Modular Las Vegas algorithms for polynomial absolute factorization (Q607052) (← links)
• On a generalization of Stickelberger's theorem (Q607067) (← links)
• A lifting and recombination algorithm for rational factorization of sparse polynomials (Q609739) (← links)
• Computing monodromy via continuation methods on random Riemann surfaces (Q633630) (← links)
• A note on Gao's algorithm for polynomial factorization (Q633632) (← links)
• On the total order of reducibility of a pencil of algebraic plane curves (Q661865) (← links)
• Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem (Q733510) (← links)
• Derandomization and absolute reconstruction for sums of powers of linear forms (Q820536) (← links)
• New recombination algorithms for bivariate polynomial factorization based on Hensel lifting (Q964741) (← links)
• An empirical study of cache-oblivious polygon indecomposability testing (Q975317) (← links)
• Indecomposability of polynomials via Jacobian matrix (Q984987) (← links)
• Parallel methods for absolute irreducibility testing (Q1009361) (← links)
• Towards toric absolute factorization (Q1030251) (← links)
• Irreducibility of polynomials modulo \(p\) via Newton polytopes. (Q1399670) (← links)
• Bivariate factorization using a critical fiber (Q1683738) (← links)
• Efficient \(q\)-integer linear decomposition of multivariate polynomials (Q2029008) (← links)
• The computation of the greatest common divisor of three bivariate Bernstein polynomials defined in a rectangular domain (Q2029179) (← links)
• Uniform bounds for the number of rational points on varieties over global fields (Q2104871) (← links)
• An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain (Q2226320) (← links)
• Complexity of solving parametric polynomial systems (Q2256707) (← links)
• Normal projection: deterministic and probabilistic algorithms (Q2258914) (← links)
• Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots (Q2341619) (← links)
• Equivalence of polynomial identity testing and polynomial factorization (Q2351391) (← links)
• Lifting and recombination techniques for absolute factorization (Q2371310) (← links)
• Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time (Q2431341) (← links)
• Improved dense multivariate polynomial factorization algorithms (Q2457431) (← links)
• An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation (Q2482628) (← links)
• Approximate factorization of multivariate polynomials using singular value decomposition (Q2482630) (← links)
• Improved explicit estimates on the number of solutions of equations over a finite field (Q2490135) (← links)
• Symbolic differentiation of factorized polynomials with repeated roots and the identification of their loci (Q2511096) (← links)
• Deterministic distinct-degree factorization of polynomials over finite fields (Q2643572) (← links)
• Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations (Q2894535) (← links)
• Primary decomposition of zero-dimensional ideals over finite fields (Q3055105) (← links)
• Sharp precision in Hensel lifting for bivariate polynomial factorization (Q3377003) (← links)
• Nombre De Facteurs Absolument Irréductibles D'un Polynôme (Q3543399) (← links)
• Regularization and Matrix Computation in Numerical Polynomial Algebra (Q3576574) (← links)
• Control of the non-geometrically integral reductions (Q5025437) (← links)
• Factorization in the multirefined tangent method (Q5158885) (← links)
• On the Sensitivity of Singular and Ill-Conditioned Linear Systems (Q5232123) (← links)
• Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring (Q5889792) (← links)
• Irreducibility of Binomials (Q6047986) (← links)
• Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond (Q6172035) (← links)
• New absolute irreducibility testing criteria and factorization of multivariate polynomials (Q6616847) (← links)
• Factoring polynomials over function fields (Q6653359) (← links)