Pages that link to "Item:Q5633653"
From MaRDI portal
The following pages link to Computational Complexity of Iterative Processes (Q5633653):
Displaying 5 items.
- A survey of techniques in applied computational complexity (Q1224857) (← links)
- Comparing parallel Newton's method with parallel Laguerre's method (Q1245560) (← links)
- Square rooting is as difficult as multiplication (Q1251897) (← links)
- A bound on the multiplicative efficiency of iteration (Q2561097) (← links)
- Second-derivative free methods of third and fourth order for solving nonlinear equations (Q5391473) (← links)
