Pages that link to "Item:Q2963249"
From MaRDI portal
The following pages link to On the boolean complexity of real root refinement (Q2963249):
Displaying 12 items.
- Transformations of matrix structures work again (Q471925) (← links)
- A generic position based method for real root isolation of zero-dimensional polynomial systems (Q480656) (← links)
- Root refinement for real polynomials using quadratic interval refinement (Q484890) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← 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)
- Bounds for polynomials on algebraic numbers and application to curve topology (Q2118214) (← links)
- Accelerated approximation of the complex roots and factors of a univariate polynomial (Q2357367) (← links)
- On the complexity of computing the topology of real algebraic space curves (Q2661918) (← links)
- Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation (Q4610020) (← links)
- Univariate Real Root Isolation over a Single Logarithmic Extension of Real Algebraic Numbers (Q4610025) (← links)
- New Practical Advances in Polynomial Root Clustering (Q5014669) (← links)
