scientific article; zbMATH DE number 953024

zbMath0861.03034MaRDI QIDQ4717945

Erich Grädel, Klaus Meer

Publication date: 12 May 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

definabilitycomplexity classeslogical languagedescriptive complexity theory over the reals

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (6)

A note on non-complete problems in \(NP_\mathbb{R}\) ⋮ On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic ⋮ Exotic quantifiers, complexity classes, and complete problems ⋮ A survey on real structural complexity theory ⋮ Counting problems over the reals ⋮ Logics which capture complexity classes over the reals

This page was built for publication: