scientific article; zbMATH DE number 3924142

MaRDI QIDQ3698313zbMATH OpenFDO

Authors Marc-Paul van der Hulst, Arjen K. Lenstra

Publication date 1985

zbMATH Keywords

polynomial-time algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• Exact polynomial factorization by approximate high degree algebraic numbers
• scientific article; zbMATH DE number 3858405
• scientific article; zbMATH DE number 3877318
• Factoring polynomials with rational coefficients
• Factoring Multivariate Polynomials over Algebraic Number Fields

Cited in

(4)

• Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
• A new method to obtain lower bounds for polynomial evaluation
• Exact polynomial factorization by approximate high degree algebraic numbers
• Deciding polynomial-transcendental problems

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 Q3698313)