Search

• < Previous
• 1
• Next >

---

Computational Complexity of Smooth Differential Equations

Akitoshi Kawamura ; Hiroyuki Ota ; Carsten Rösnick ; Martin Ziegler.

The computational complexity of the solutions $h$ to the ordinary differential equation $h(0)=0$, $h'(t) = g(t, h(t))$ under various assumptions on the function $g$ has been investigated. Kawamura showed in 2010 that the solution $h$ can be PSPACE-hard even if $g$ is assumed to be Lipschitz&nbsp;[&hellip;]

---

Closed Sets and Operators thereon: Representations, Computability and Complexity

Carsten Rösnick-Neugebauer.

The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such representations had been devised over the past decades,&nbsp;[&hellip;]

---