scientific article; zbMATH DE number 1223631
From MaRDI portal
Publication:4218942
zbMath0914.03049MaRDI QIDQ4218942
Publication date: 21 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
functional equationsfinite model theorydescriptive complexity theorylogical characterization of complexity classes
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
Graph properties checkable in linear time in the number of vertices ⋮ The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey ⋮ Linear time and the power of one first-order universal quantifier