Uniform computational complexity of Taylor series
Author:
- 1 January 1987
- book chapter
- Published by Springer Nature
- p. 435-444
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Subpolynomial complexity classes of real functions and real numbers1986
- Theory of representationsTheoretical Computer Science, 1985
- The computational complexity of maximization and integrationAdvances in Mathematics, 1984
- Computational complexity of real functionsTheoretical Computer Science, 1982
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- On-line algorithms for the design of pipeline architectures1979
- Fast Multiple-Precision Evaluation of Elementary FunctionsJournal of the ACM, 1976
- Berechenbare Reelle FunktionenfolgenMathematical Logic Quarterly, 1976
- Signed-Digit Numbe Representations for Fast Parallel ArithmeticIEEE Transactions on Electronic Computers, 1961