Computational complexity of computing polynomials over the fields of real and complex numbers
DOI10.1145/800133.804344zbMath1282.68128MaRDI QIDQ5402553
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
evaluation; preconditioning; polynomial; complexity of computation; number of arithmetic operations; lower bounds of complexity; optimal schemes of computation; scheme of computation; upper bounds of complexity
68W30: Symbolic computation and algebraic computation
03D15: Complexity of computation (including implicit computational complexity)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
03D78: Computation over the reals, computable analysis
Related Items