Uniform computational complexity of the derivatives of C^-functions.
From MaRDI portal
Publication:1607286
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
Cites work
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 1096865 (Why is no real title available?)
- Computability and Noncomputability in Classical Analysis
- Computational complexity of real functions
- Numerical mathematics
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
Cited in
(5)- Computing power series in polynomial time
- On parallel complexity of analytic functions
- scientific article; zbMATH DE number 4051615 (Why is no real title available?)
- On the tabulation complexity of infinitely differentiable functions and functions specified by the Hölder condition on their derivatives
- Pointwise complexity of the derivative of a computable function
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)