Publication:4657306
From MaRDI portal
zbMath1134.68597MaRDI QIDQ4657306
Publication date: 14 March 2005
LLL algorithm; exponential complexity; absolute factorization of a polynomial; minimal zero-sum relations
68W40: Analysis of algorithms
68W30: Symbolic computation and algebraic computation
65H10: Numerical computation of solutions to systems of equations
13P05: Polynomials, factorization in commutative rings
Related Items
Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients, Modular Las Vegas algorithms for polynomial absolute factorization, Towards toric absolute factorization, Lifting and recombination techniques for absolute factorization, From an approximate to an exact absolute polynomial factorization, Approximate factorization of multivariate polynomials using singular value decomposition