Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations
From MaRDI portal
Recommendations
- A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations
- Characterizing time computational complexity classes with polynomial differential equations
- Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length
- Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length: the general purpose analog computer and computable analysis are two efficiently equivalent models of computations
- A theory of complexity for continuous time systems
Cites work
- scientific article; zbMATH DE number 445159 (Why is no real title available?)
- scientific article; zbMATH DE number 3857078 (Why is no real title available?)
- scientific article; zbMATH DE number 3176984 (Why is no real title available?)
- scientific article; zbMATH DE number 194009 (Why is no real title available?)
- scientific article; zbMATH DE number 2079048 (Why is no real title available?)
- scientific article; zbMATH DE number 1564073 (Why is no real title available?)
- scientific article; zbMATH DE number 806752 (Why is no real title available?)
- scientific article; zbMATH DE number 3292104 (Why is no real title available?)
- scientific article; zbMATH DE number 3096283 (Why is no real title available?)
- scientific article; zbMATH DE number 3105099 (Why is no real title available?)
- scientific article; zbMATH DE number 3109695 (Why is no real title available?)
- A Universal Ordinary Differential Equation
- A new recursion-theoretic characterization of the polytime functions
- An analog characterization of the Grzegorczyk hierarchy
- Discrete calculus by analogy
- Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
- Introduction to algorithms.
- On the computational complexity of ordinary differential equations
- Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length
- Recursion theory on the reals and continuous-time computation
- The New Promise of Analog Computation
- The P\(\neq\) NP conjecture in the context of real and complex analysis
Cited in
(7)- A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations
- A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations
- Characterizing time computational complexity classes with polynomial differential equations
- Simulation of Turing machines with analytic discrete ODEs: polynomial-time and space over the reals characterised with discrete ordinary differential equations
- COMPUTATIONALLY EFFICIENT RECURSIONS FOR TOP-ORDER INVARIANT POLYNOMIALS WITH APPLICATIONS
- The complexity of computing in continuous time: space complexity is precision
- A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations
This page was built for publication: Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092382)
