scientific article; zbMATH DE number 1253962

MaRDI QIDQ4226936zbMATH OpenFDO

Authors Joachim von zur Gathen, Jürgen Gerhard

Publication date 30 May 1999

Mathematics Subject Classification ID

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

Cited in

(19)

• Efficient isolation of polynomial's real roots.
• The complexity of subdivision for diameter-distance tests
• Fast Hermite interpolation and evaluation over finite fields of characteristic two
• Complexity of real root isolation using continued fractions
• Fast systematic encoding of multiplicity codes
• 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
• On the complexity of real root isolation using continued fractions
• A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
• Improved bounds for the CF algorithm
• On the computing time of the continued fractions method
• Simple and nearly optimal polynomial root-finding by means of root radii approximation
• Continued fraction real root isolation using the Hong root bound
• Basic polynomial algebra subprograms
• On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
• A deterministic algorithm for isolating real roots of a real polynomial
• msolve. A library for solving polynomial systems
• Root radii and subdivision for polynomial root-finding

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 Q4226936)