Pages that link to "Item:Q2172649"
From MaRDI portal
The following pages link to On the complexity of the Plantinga-Vegter algorithm (Q2172649):
Displaying 4 items.
- The complexity of subdivision for diameter-distance tests (Q2188972) (← links)
- Functional norms, condition numbers and numerical algorithms in algebraic geometry (Q5056386) (← links)
- The Complexity of an Adaptive Subdivision Method for Approximating Real Curves (Q5119923) (← links)
- Plantinga-Vegter Algorithm takes Average Polynomial Time (Q5120482) (← links)