scientific article; zbMATH DE number 2145002

MaRDI QIDQ4657306zbMATH OpenFDO

Authors Guillaume Chèze

Publication date 14 March 2005

zbMATH Keywords

LLL algorithmexponential complexityabsolute factorization of a polynomialminimal zero-sum relations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40) Numerical computation of solutions to systems of equations (65H10) Polynomials, factorization in commutative rings (13P05)

Recommendations

• Modular Las Vegas algorithms for polynomial absolute factorization
• Factoring polynomials and the knapsack problem
• Four lectures on polynomial absolute factorization
• scientific article; zbMATH DE number 2151216
• Lifting and recombination techniques for absolute factorization

Cited in

(8)

• Algebraic osculation and application to factorization of sparse polynomials
• Towards toric absolute factorization
• Symmetry detection of rational space curves from their curvature and torsion
• Modular Las Vegas algorithms for polynomial absolute factorization
• From an approximate to an exact absolute polynomial factorization
• Lifting and recombination techniques for absolute factorization
• Approximate factorization of multivariate polynomials using singular value decomposition
• Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4657306)