Pages that link to "Item:Q1095599"
From MaRDI portal
The following pages link to Algebraic complexity of computing polynomial zeros (Q1095599):
Displayed 7 items.
- Polynomial division and its computational complexity (Q1094135) (← links)
- Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← links)
- Complexity of parallel matrix computations (Q1100892) (← links)
- Distances from differences of roots of polynomials to the nearest integers (Q1199554) (← links)
- Effective asymptotics of linear recurrences with rational coefficients (Q1917520) (← links)
- A technology for reverse-engineering a combinatorial problem from a rational generating function (Q5933434) (← links)
- Solving matrix polynomial equations arising in queueing problems (Q5956252) (← links)