Characterizing time computational complexity classes with polynomial differential equations
From MaRDI portal
Publication:5880938
Recommendations
- 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
- An analog characterization of the Grzegorczyk hierarchy
- Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations
- A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations
Cites work
- scientific article; zbMATH DE number 1583876 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 766966 (Why is no real title available?)
- scientific article; zbMATH DE number 3083488 (Why is no real title available?)
- A tutorial on computable analysis
- An analog characterization of the Grzegorczyk hierarchy
- Analog computers and recursive functions over the reals.
- Automata, Languages and Programming
- Classical recursion theory. Vol. II
- Computability with polynomial differential equations
- Computational Complexity
- Computational complexity of real functions
- Computational complexity of solving polynomial differential equations over unbounded domains
- Computing with polynomial ordinary differential equations
- Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions
- Iteration, inequalities, and differentiability in analog computers
- Mathematical Theory of the Differential Analyzer
- On the functions generated by the general purpose analog computer
- Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length
- Polynomial differential equations compute all real computable functions on computable compact intervals
- 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
- Some recent developments on Shannon's General Purpose Analog Computer
- Theory and Applications of Models of Computation
- Universal computation and other capabilities of hybrid and continuous dynamical systems
Cited in
(6)- Programming with ordinary differential equations: some first steps towards a programming language
- Computational complexity of solving polynomial differential equations over unbounded domains
- A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations
- Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length
- scientific article; zbMATH DE number 1543364 (Why is no real title available?)
- On the complexity of the differential-algebraic description of analytic complexity classes
This page was built for publication: Characterizing time computational complexity classes with polynomial differential equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5880938)
