scientific article; zbMATH DE number 3877318

MaRDI QIDQ3344294zbMATH OpenFDO

Authors Arjen K. Lenstra

Publication date 1984

zbMATH Keywords

polynomial-time algorithm

Mathematics Subject Classification ID

Polynomials in real and complex fields: factorization (12D05) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 3858405
• Factoring polynomials with rational coefficients
• On One Method for Factorization of Algebraic Polynomials
• On one method of factorization of polynomials
• scientific article; zbMATH DE number 3909733

Cited in

(7)

• On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems
• The distribution of the zeros generated by length-bounded polynomials
• scientific article; zbMATH DE number 3924142 (Why is no real title available?)
• Selected applications of LLL in number theory
• On finite-precision representations of geometric objects
• Kronecker's and Newton's approaches to solving: a first comparison
• Two design principles of geometric algorithms in finite-precision arithmetic

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