A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations
From MaRDI portal
Publication:6116835
DOI10.1007/s00037-023-00240-1arXiv2209.12168MaRDI QIDQ6116835
No author found.
Publication date: 16 August 2023
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.12168
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20) Numerical methods for ordinary differential equations (65L99) General topics in the theory of computing (68Q01) Numerical methods for difference equations (65Q10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classical recursion theory. The theory of functions and sets of natural numbers.
- A new recursion-theoretic characterization of the polytime functions
- Recursion theory on the reals and continuous-time computation
- An analog characterization of the Grzegorczyk hierarchy
- The P\(\neq\) NP conjecture in the context of real and complex analysis
- On the computational complexity of ordinary differential equations
- Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length
- Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
- Discrete Calculus By Analogy
- Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations
- The New Promise of Analog Computation
- Subrecursiveness: Machine-independent notions of computability in restricted time and storage
