A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations

This paper studies the expressive and computational power of discrete Ordinary Differential Equations (ODEs), a.k.a. (Ordinary) Difference Equations. It presents a new framework using these equations as a central tool for computation and algorithm design. We present the general theory of discrete OD...

Full description

Saved in:

Bibliographic Details
Published in:	Computational complexity Vol. 32; no. 2; p. 7
Main Authors:	Bournez, Olivier, Durand, Arnaud
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 01.12.2023 Springer Nature B.V Springer Verlag
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Complexity Computation Computational Mathematics and Numerical Analysis Computer Science Difference equations Differential equations Ordinary differential equations Polynomials 68Q15 03D20 68Q01 65Q10 discrete ordinary differential equations recursion scheme 03D15 Implicit complexity difference equations 65L99
ISSN:	1016-3328, 1420-8954
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!