Saturation and stability in the theory of computation over the reals (Q1304539)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1339978
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Saturation and stability in the theory of computation over the reals |
scientific article; zbMATH DE number 1339978 |
Statements
Saturation and stability in the theory of computation over the reals (English)
0 references
8 February 2000
0 references
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.
0 references
real-closed field
0 references
computational complexity
0 references
parallel computation
0 references
ordered vector spaces
0 references
0 references
0.8106598258018494
0 references
