The following pages link to (Q3447174):
Displaying 20 items.
- Continuous amortization and extensions: with applications to bisection-based root isolation (Q277222) (← links)
- Finding the number of roots of a polynomial in a plane region using the winding number (Q316523) (← links)
- A note on Legendre-Fenchel conjugate of the product of two positive-definite quadratic forms (Q384183) (← links)
- Improved bounds for the CF algorithm (Q385006) (← links)
- Root refinement for real polynomials using quadratic interval refinement (Q484890) (← links)
- Computing real roots of real polynomials (Q491245) (← links)
- A general approach to isolating roots of a bitstream polynomial (Q655157) (← links)
- SqFreeEVAL: An (almost) optimal real-root isolation algorithm (Q655566) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- On the asymptotic and practical complexity of solving bivariate systems over the reals (Q1025391) (← links)
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration (Q1680157) (← links)
- Univariate real root isolation in an extension field and applications (Q1757003) (← links)
- On the topology and isotopic meshing of plane algebraic curves (Q2179658) (← links)
- The complexity of subdivision for diameter-distance tests (Q2188972) (← links)
- On the Davenport-Mahler bound (Q2360668) (← links)
- On the complexity of the Descartes method when using approximate arithmetic (Q2447639) (← links)
- On the complexity of real root isolation using continued fractions (Q2476019) (← links)
- A symbolic-numerical algorithm for isolating real roots of certain radical expressions (Q2656085) (← links)
- On the Complexity of Reliable Root Approximation (Q3644097) (← links)
- Univariate Real Root Isolation over a Single Logarithmic Extension of Real Algebraic Numbers (Q4610025) (← links)