Pages that link to "Item:Q3644097"
From MaRDI portal
The following pages link to On the Complexity of Reliable Root Approximation (Q3644097):
Displaying 7 items.
- Root-neededness and approximations of neededness (Q293367) (← links)
- Root refinement for real polynomials using quadratic interval refinement (Q484890) (← links)
- On the complexity of computing the logarithm and square root functions on a complex domain (Q870336) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- An efficient method to compute the rate matrix for retrial queues with large number of servers (Q968566) (← links)
- (Q3345695) (← links)
- (Q3350675) (← links)