Distances from differences of roots of polynomials to the nearest integers

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

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

Publication date: 16 January 1993

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

zbMATH Keywords

computational complexity; roots of polynomials; root separation; power series solutions of ordinary differential equations

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

11Y16: Number-theoretic algorithms; complexity

30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)

65H05: Numerical computation of solutions to single equations

13B25: Polynomials over commutative rings

13P05: Polynomials, factorization in commutative rings

11R09: Polynomials (irreducibility, etc.)

Related Items

Polynomials with a root close to an integer

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item