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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computational complexity Ročník 32; číslo 2; s. 7
Hlavní autori:	Bournez, Olivier, Durand, Arnaud
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cham Springer International Publishing 01.12.2023 Springer Nature B.V Springer Verlag
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!