Saturation and stability in the theory of computation over the reals (Q1304539)

From MaRDI portal
Revision as of 03:51, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Saturation and stability in the theory of computation over the reals
scientific article

    Statements

    Saturation and stability in the theory of computation over the reals (English)
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    real-closed field
    0 references
    computational complexity
    0 references
    parallel computation
    0 references
    ordered vector spaces
    0 references