scientific article; zbMATH DE number 1253962

zbMath1005.68996MaRDI QIDQ4226936

Jürgen Gerhard, Joachim von zur Gathen

Publication date: 30 May 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computation of special functions and constants, construction of tables (65D20)

Related Items

A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers, Root radii and subdivision for polynomial root-finding, Complexity of real root isolation using continued fractions, A deterministic algorithm for isolating real roots of a real polynomial, Improved bounds for the CF algorithm, The complexity of subdivision for diameter-distance tests, Fast systematic encoding of multiplicity codes, On the computing time of the continued fractions method, Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation, Efficient isolation of polynomial's real roots., On the complexity of the Descartes method when using approximate arithmetic, Vincent's theorem of 1836: overview and future research, Fast computation of special resultants, Continued fraction real root isolation using the Hong root bound, On the complexity of real root isolation using continued fractions, On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers, Basic Polynomial Algebra Subprograms, Fast Hermite interpolation and evaluation over finite fields of characteristic two