scientific article; zbMATH DE number 4051615
From MaRDI portal
Publication:3788007
Recommendations
- Computing power series in polynomial time
- Uniform computational complexity of the derivatives of \(C^{\infty}\)-functions.
- scientific article; zbMATH DE number 52121
- Numerics of analytic functions and complexity
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
Cited in
(17)- Computing power series in polynomial time
- Low complexity k-dimensional Taylor forms
- On the complexity of online computations of real functions
- A refined model of computation for continuous problems
- Uniform computational complexity of the derivatives of \(C^{\infty}\)-functions.
- Computability on computable metric spaces
- Type 2 computational complexity of functions on Cantor's space
- The complexity of divisibility
- On parallel complexity of analytic functions
- On the computational complexity of the Dirichlet problem for Poisson's equation
- Lower bounds on the continuation of holomorphic functions
- Representations and evaluation strategies for feasibly approximable functions
- Average-case polynomial-time computability of Hamiltonian dynamics
- Computability of Differential Equations
- Computing the exact number of periodic orbits for planar flows
- Computability and computational complexity of the evolution of nonlinear dynamical systems
- Computation with real numbers and continuous-time dynamical systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3788007)
