Pages that link to "Item:Q4018402"
From MaRDI portal
The following pages link to On the Complexity of Polynomial Zeros (Q4018402):
Displaying 12 items.
- On the complexity of failed zero forcing (Q729899) (← links)
- Graph compression and the zeros of polynomials (Q834888) (← links)
- On zeros of exponential polynomials and quantum algorithms (Q989909) (← links)
- A polynomial-time algorithm for finding zero-sums. (Q1043611) (← links)
- Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
- Simultaneous factorization of a polynomial by rational approximation (Q1903657) (← links)
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- Efficient parallel factorization and solution of structured and unstructured linear systems (Q2486566) (← links)
- On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection (Q2985822) (← links)
- (Q3074627) (← links)
- (Q3776504) (← links)
- On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials (Q3831940) (← links)