Congruence arithmetic algorithms for polynomial real zero determination

DOI10.1016/S0022-0000(74)80041-3zbMath0287.65036OpenAlexW2046397708MaRDI QIDQ1846327

Lee E. Heindel

Publication date: 1974

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(74)80041-3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to single equations (65H05) Algorithms in computer science (68W99)

Cites Work

• Unnamed Item
• A Generalization of a Theorem of Bôcher
• Integer Arithmetic Algorithms for Polynomial Real Zero Determination
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• On Euclid's Algorithm and the Theory of Subresultants
• The Calculation of Multivariate Polynomial Resultants

This page was built for publication: Congruence arithmetic algorithms for polynomial real zero determination