Martin Ziegler

Model theory of modules

Elimination des quantifieurs. La classification de stabilite. Decomposition des modules compactes. Rangs des modules indecomposables. Le spectre

Quasi finitely axiomatizable totally categorical theories

On demontre que toutes les theories presque fortement minimales totalement categoriques sont axiomatisables par un nombre fini daxiomes et le schema dinfini

Computational complexity of smooth differential equations

The computational complexity of the solutions

Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra

h

Computational benefit of smoothness

to the ordinaryndifferential equation

Computational Complexity of Quantum Satisfiability

h(0)=0

Towards Computational Complexity Theory on Advanced Function Spaces in Analysis

,

On Computability of Navier-Stokes’ Equation

h(t) = g(t, h(t))

Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines.

under various assumptionsnon the function

On the Computational Complexity of Positive Linear Functionals on

g