The following pages link to A new proof of Vincent's theorem (Q1594939):
Displaying 15 items.
- Improved bounds for the CF algorithm (Q385006) (← links)
- On the computing time of the continued fractions method (Q438690) (← links)
- Computing real roots of real polynomials (Q491245) (← links)
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers (Q533873) (← 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)
- A new proof of Vázsonyi's conjecture (Q942175) (← links)
- Localization of real algebraic hypersurfaces with applications to the enumeration of the classes of relative equilibria of a \((5+1)\)-body problem (Q2304276) (← links)
- Complexity of real root isolation using continued fractions (Q2378508) (← links)
- On the complexity of the Descartes method when using approximate arithmetic (Q2447639) (← links)
- Vincent's theorem of 1836: overview and future research (Q2452926) (← links)
- New bounds for the Descartes method (Q2457314) (← links)
- On the complexity of real root isolation using continued fractions (Q2476019) (← links)
- (Q4629135) (← links)
- (Q5173756) (← links)