Uniform computational complexity of the derivatives of \(C^{\infty}\)-functions.

DOI10.1016/S0304-3975(01)00062-7zbMath1051.68074MaRDI QIDQ1607286

Markus Bläser

Publication date: 31 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Computational complexityRecursive analysisDerivative

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Constructive and recursive analysis (03F60) Complexity of computation (including implicit computational complexity) (03D15) (C^infty)-functions, quasi-analytic functions (26E10)

Related Items (1)

On parallel complexity of analytic functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational complexity of real functions
• Computability and Noncomputability in Classical Analysis
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Numerical mathematics

This page was built for publication: Uniform computational complexity of the derivatives of \(C^{\infty}\)-functions.