Bournez, O., & Durand, A. (2023). A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations. Computational complexity, 32(2), 7. https://doi.org/10.1007/s00037-023-00240-1
Chicago Style (17th ed.) CitationBournez, Olivier, and Arnaud Durand. "A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations." Computational Complexity 32, no. 2 (2023): 7. https://doi.org/10.1007/s00037-023-00240-1.
MLA (9th ed.) CitationBournez, Olivier, and Arnaud Durand. "A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations." Computational Complexity, vol. 32, no. 2, 2023, p. 7, https://doi.org/10.1007/s00037-023-00240-1.