Computational complexity of computing polynomials over the fields of real and complex numbers
From MaRDI portal
Recommendations
Cited in
(9)- scientific article; zbMATH DE number 4070302 (Why is no real title available?)
- Polynomials with Rational Coefficients Which are Hard to Compute
- Piecewise algebraic functions
- Evaluation of complex polynomials in one and two variables
- Lower bounds in algebraic computational complexity
- A logarithmic Boolean time algorithm for parallel polynomial division
- Algebraic complexity of computing polynomial zeros
- Computation of Minkowski values of polynomials over complex sets
- The Computational Complexity of Division in Quadratic Extension Fields
This page was built for publication: Computational complexity of computing polynomials over the fields of real and complex numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402553)