A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations. (English) Zbl 07727625
Reviewer: Arne Meier (Hannover)
Found 3 Documents (Results 1–3)
Beyond Erdős-Kunen-Mauldin: shift-compactness properties and singular sets. (English) Zbl 1466.26003
Reviewer: K. P. Hart (Delft)
Recursion schemes, discrete differential equations and characterization of polynomial time computations. (English) Zbl 1541.68142
Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 23, 14 p. (2019).
Filter Results by …
Document Type
- Journal Articles (2)
- Collection Articles (1)
Author
- Bournez, Olivier (2)
- Miller-van Wieren, Leila (1)
- Miller, Harry I. (1)
- Ostaszewski, Adam J. (1)
Serial
- Topology Appl. (1)
- Comput. Complexity (1)
