Logics which capture complexity classes over the reals
From MaRDI portal
Publication:4254641
DOI10.2307/2586770zbMath0933.03047OpenAlexW2739750561MaRDI QIDQ4254641
Publication date: 29 June 1999
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2586770
descriptive complexity theoryreal number model of computationlogical description of complexity classes
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
A logical characterization of constant-depth circuits over the reals ⋮ Implicit complexity over an arbitrary structure: Quantifier alternations ⋮ Periodic generalized automata over the reals ⋮ Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals ⋮ Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals ⋮ Exotic quantifiers, complexity classes, and complete problems ⋮ Counting problems over the reals ⋮ Real computations with fake numbers
Cites Work
This page was built for publication: Logics which capture complexity classes over the reals
