Logics which capture complexity classes over the reals
DOI10.2307/2586770zbMATH Open0933.03047OpenAlexW2739750561MaRDI QIDQ4254641FDOQ4254641
Authors: Felipe Cucker, Klaus Meer 
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
Recommendations
descriptive complexity theoryreal number model of computationlogical description of complexity classes
Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)
Cites Work
Cited In (14)
- Metafinite model theory and real number computations
- Title not available (Why is that?)
- Exotic quantifiers, complexity classes, and complete problems
- A logical characterization of constant-depth circuits over the reals
- Logical characterizations of algebraic circuit classes over integral domains
- Implicit complexity over an arbitrary structure: Quantifier alternations
- Periodic generalized automata over the reals
- Counting problems over the reals
- Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals
- Logics for complexity classes
- Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals
- Logics which capture complexity classes over the reals
- Logics capturing relativized complexity classes uniformly
- Real computations with fake numbers
This page was built for publication: Logics which capture complexity classes over the reals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4254641)
