Pages that link to "Item:Q1095599"
From MaRDI portal
The following pages link to Algebraic complexity of computing polynomial zeros (Q1095599):
Displaying 17 items.
- A polynomial-time algorithm for finding zero-sums. (Q1043611) (← links)
- 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)
- On the worst-case arithmetic complexity of approximating zeros of polynomials (Q1101184) (← links)
- Distances from differences of roots of polynomials to the nearest integers (Q1199554) (← links)
- Effective asymptotics of linear recurrences with rational coefficients (Q1917520) (← links)
- Computational aspects of the general Rodrigues problem (Q2080604) (← links)
- Computing zero-dimensional schemes (Q2456531) (← links)
- On Multiple Eigenvalues of a Matrix Dependent on a Parameter (Q2830007) (← links)
- On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection (Q2985822) (← links)
- On the cost of computing roots of polynomials (Q3330394) (← links)
- On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials (Q3831940) (← links)
- Complexity of Computations with Matrices and Polynomials (Q4016917) (← links)
- Logical Approaches to Computational Barriers (Q5898841) (← 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)
