Pages that link to "Item:Q1845616"
From MaRDI portal
The following pages link to A new upper bound on the complexity of derivative evaluation (Q1845616):
Displaying 5 items.
- A survey of techniques in applied computational complexity (Q1224857) (← links)
- Selection of good algorithms from a family of algorithms for polynomial derivative evaluation (Q1248372) (← links)
- On the arithmetic operational complexity for solving Vandermonde linear equations (Q2258368) (← links)
- A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity (Q3566648) (← links)
- Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications (Q5928297) (← links)
