The following pages link to (Q4226967):
Displaying 17 items.
- Computing real roots of real polynomials (Q491245) (← links)
- A deterministic algorithm for isolating real roots of a real polynomial (Q607163) (← links)
- A general approach to isolating roots of a bitstream polynomial (Q655157) (← links)
- On the computation of an arrangement of quadrics in 3D (Q705551) (← links)
- Approximate root isolation for nonlinear systems by Monte-Carlo (Q1324399) (← links)
- Computing in the field of complex algebraic numbers (Q1382036) (← links)
- Efficient isolation of polynomial's real roots. (Q1421215) (← links)
- Univariate real root isolation in an extension field and applications (Q1757003) (← links)
- Interval arithmetic in cylindrical algebraic decomposition (Q1864882) (← links)
- A real polynomial decision algorithm using arbitrary-precision floating point arithmetic (Q1971088) (← links)
- On the complexity of the Descartes method when using approximate arithmetic (Q2447639) (← links)
- New bounds for the Descartes method (Q2457314) (← links)
- Real solution isolation using interval arithmetic (Q2458505) (← links)
- A new method for real root isolation of univariate polynomials (Q2468357) (← links)
- Real Root Isolation of Polynomial Equations Based on Hybrid Computation (Q2799571) (← links)
- Univariate Real Root Isolation over a Single Logarithmic Extension of Real Algebraic Numbers (Q4610025) (← links)
- When Newton meets Descartes (Q5244548) (← links)
