Pages that link to "Item:Q2188972"
From MaRDI portal
The following pages link to The complexity of subdivision for diameter-distance tests (Q2188972):
Displaying 5 items.
- Inflation of poorly conditioned zeros of systems of analytic functions (Q823834) (← links)
- Certified numerical algorithm for isolating the singularities of the plane projection of generic smooth space curves (Q2029428) (← links)
- On the complexity of the Plantinga-Vegter algorithm (Q2172649) (← links)
- The Complexity of an Adaptive Subdivision Method for Approximating Real Curves (Q5119923) (← links)
- Plantinga-Vegter Algorithm takes Average Polynomial Time (Q5120482) (← links)