Computational complexity of computing polynomials over the fields of real and complex numbers

DOI10.1145/800133.804344zbMath1282.68128OpenAlexW2108615867MaRDI QIDQ5402553

Pan, Victor Y.

Publication date: 14 March 2014

Published in: Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/800133.804344

zbMATH Keywords

evaluationpreconditioningpolynomialcomplexity of computationnumber of arithmetic operationslower bounds of complexityoptimal schemes of computationscheme of computationupper bounds of complexity

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computation over the reals, computable analysis (03D78)

Related Items (3)

A logarithmic Boolean time algorithm for parallel polynomial division ⋮ Piecewise algebraic functions ⋮ Lower bounds in algebraic computational complexity

This page was built for publication: Computational complexity of computing polynomials over the fields of real and complex numbers