Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations

DOI10.4230/LIPIcs.MFCS.2019.23OpenAlexW2970723491MaRDI QIDQ5092382

No author found.

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1810.02241

zbMATH Keywords

implicit complexityrecursion schemediscrete ordinary differential equations

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations ⋮ A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations

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
• 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
• A Universal Ordinary Differential Equation
• The New Promise of Analog Computation

This page was built for publication: Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations