Simple Proofs of Lower Bounds for Polynomial Evaluation
From MaRDI portal
Publication:4999419
DOI10.1007/978-1-4684-2001-2_3zbMath1467.68070MaRDI QIDQ4999419
Edward M. Reingold, A. Ian Stocks
Publication date: 6 July 2021
Published in: Complexity of Computer Computations (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4684-2001-2_3
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
65H04: Numerical computation of roots of polynomial equations
Related Items
Test complexity of generic polynomials, A survey of techniques in applied computational complexity, Lower bound for the approximative complexity