Distances from differences of roots of polynomials to the nearest integers

DOI10.1016/0020-0190(92)90006-HzbMath0754.13008OpenAlexW1995531406MaRDI QIDQ1199554

V. I. Galiev, A. F. Polupanov, Igor E. Shparlinski

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90006-h

zbMATH Keywords

computational complexityroots of polynomialsroot separationpower series solutions of ordinary differential equations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Polynomials over commutative rings (13B25) Polynomials, factorization in commutative rings (13P05) Polynomials (irreducibility, etc.) (11R09)

Related Items

Polynomials with a root close to an integer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Irreducibility of multivariate polynomials
• Algebraic complexity of computing polynomial zeros
• An inequality about irreducible factors of integer polynomials
• Diophantine approximation
• On the construction of solutions of systems of linear ordinary differential equations in the neighbourhood of a regular singularity
• Computational problems, methods, and results in algebraic number theory
• Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
• Computing Rational Zeros of Integral Polynomials by p-Adic Expansion
• The Calculation of Multivariate Polynomial Resultants