Pages that link to "Item:Q5402553"
From MaRDI portal
The following pages link to Computational complexity of computing polynomials over the fields of real and complex numbers (Q5402553):
Displaying 5 items.
- Lower bounds in algebraic computational complexity (Q1057648) (← links)
- Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
- A logarithmic Boolean time algorithm for parallel polynomial division (Q1107986) (← links)
- Computation of Minkowski values of polynomials over complex sets (Q1826500) (← links)
- Piecewise algebraic functions (Q2277540) (← links)