Pages that link to "Item:Q2365414"
From MaRDI portal
The following pages link to Topological complexity of zero-finding (Q2365414):
Displaying 6 items.
- A refined model of computation for continuous problems (Q1265141) (← links)
- On the cost of uniform and nonuniform algorithms (Q1292410) (← links)
- Why does information-based complexity use the real number model? (Q1292417) (← links)
- Topological complexity of zero finding with algebraic operations (Q1872637) (← links)
- Complexity of linear problems with a fixed output basis (Q1977152) (← links)
- On the geometry of Graeffe iteration (Q5949383) (← links)