Pages that link to "Item:Q2958973"
From MaRDI portal
The following pages link to Almost tight recursion tree bounds for the Descartes method (Q2958973):
Displayed 26 items.
- Continuous amortization and extensions: with applications to bisection-based root isolation (Q277222) (← links)
- 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 the maximum computing time of the bisection method for real root isolation (Q507151) (← 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)
- On the topology of real algebraic plane curves (Q626980) (← links)
- A general approach to isolating roots of a bitstream polynomial (Q655157) (← links)
- SqFreeEVAL: An (almost) optimal real-root isolation algorithm (Q655566) (← links)
- Topology and arrangement computation of semi-algebraic planar curves (Q735517) (← links)
- Certificates of positivity in the Bernstein basis (Q938310) (← links)
- Subdivision methods for solving polynomial equations (Q1006659) (← links)
- On the asymptotic and practical complexity of solving bivariate systems over the reals (Q1025391) (← links)
- Revisiting the problem of zeros of univariate scalar Béziers (Q1632405) (← links)
- Univariate real root isolation in an extension field and applications (Q1757003) (← links)
- Sampling polynomial trajectories for LTL verification (Q2055964) (← links)
- The complexity of subdivision for diameter-distance tests (Q2188972) (← links)
- Separation bounds for polynomial systems (Q2188979) (← links)
- On the Davenport-Mahler bound (Q2360668) (← links)
- Complexity of real root isolation using continued fractions (Q2378508) (← 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)
- Near optimal subdivision algorithms for real root isolation (Q2628307) (← links)
- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time (Q3533023) (← links)
- On the Complexity of Reliable Root Approximation (Q3644097) (← links)