1. V.I. Arnold (1978). Ordinary Differential Equations. MIT Press.
2. Stephen Bellantoni & Stephen Cook (1992). A new recursion_
theoretic characterization of the poly-time functions. Computational
Complexity 2, 97–110.
3. Garrett Birkhoff & Gian-Carlo Rota (1989). Ordinary Differential
Equations. John Wiley & Sons, 4th edition.
4. Olivier Bournez & Arnaud Durand (2019). Recursion Schemes,
Discrete Differential Equations and Characterization of Polynomial
Time Computations. In 44th International Symposium on Mathematical
Foundations of Computer Science, MFCS 2019, August 26–30, 2019,
Aachen, Germany, Peter Rossmanith, Pinar Heggernes & Joost-
Pieter Katoen, editors, volume 138 of LIPIcs, 23:1–23:14. Schloss
Dagstuhl - Leibniz-Zentrum f¨ur Informatik. URL https://doi.org/10.4230/LIPIcs.MFCS.2019.23.
5. Olivier Bournez, Daniel S. Graςa & Amaury Pouly (2017).
Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential
Equations of Polynomial Length. Journal of the ACM 64(6),
38:1–38:76.