Uniform computational complexity of the derivatives of C^-functions.

DOI10.1016/S0304-3975(01)00062-7zbMATH Open1051.68074MaRDI QIDQ1607286FDOQ1607286

Authors: Markus Bläser 

Publication date: 31 July 2002

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

Recommendations

• scientific article; zbMATH DE number 4051615
• Derivatives of Computable Functions
• scientific article; zbMATH DE number 52121
• On parallel complexity of analytic functions
• Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy

zbMATH Keywords

Computational complexityRecursive analysisDerivative

Mathematics Subject Classification ID

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

Cites Work

• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computability and Noncomputability in Classical Analysis
• Title not available (Why is that?)
• Computational complexity of real functions
• Numerical mathematics

Cited In (4)

• Computing power series in polynomial time
• Title not available (Why is that?)
• On parallel complexity of analytic functions
• On the tabulation complexity of infinitely differentiable functions and functions specified by the Hölder condition on their derivatives

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607286)