scientific article
From MaRDI portal
Publication:3933736
zbMATH Open0477.68040MaRDI QIDQ3933736FDOQ3933736
Publication date: 1981
Title of this publication is not available (Why is that?)
Symbolic computation and algebraic computation (68W30) Polynomials in number theory (11C08) Numerical computation of solutions to single equations (65H05)
Cited In (8)
- On the computing time of the continued fractions method
- Complexity of real root isolation using continued fractions
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- On cubic exceptional units
- The Root Separation of Polynomials and Some Applications
- Algebraic complexity of computing polynomial zeros
- On the maximum computing time of the bisection method for real root isolation
- Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros
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 Q3933736)