Saturation and stability in the theory of computation over the reals
This paper deals with computational complexity over structures for first-order languages. In particular, the authors obtain several results concerning /const complexity classes (as introduced by Michaux) for real-closed fields and ordered vector spaces over the rationals.
scientific article; zbMATH DE number 1339978
scientific article