scientific article
From MaRDI portal
Publication:3830533
zbMath0675.68032MaRDI QIDQ3830533
No author found.
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Complexity of computation (including implicit computational complexity) (03D15) Algorithms in computer science (68W99)
Related Items (23)
Reachability and the power of local ordering ⋮ How to define a linear order on finite models ⋮ Dyn-FO: A parallel, dynamic complexity class ⋮ Hierarchies in transitive closure logic, stratified Datalog and infinitary logic ⋮ Metafinite model theory ⋮ The complexity of graph connectivity ⋮ \(\Delta\)-languages for sets and LOGSPACE computable graph transformers ⋮ Comparing the power of monadic NP games ⋮ Computing on structures ⋮ Tailoring recursion for complexity ⋮ A note on the approximation of the MAX CLIQUE problem ⋮ The invariant problem for binary string structures and the parallel complexity theory of queries ⋮ Implicit definability and infinitary logic in finite model theory ⋮ Capturing complexity classes by fragments of second-order logic ⋮ A restricted second order logic for finite structures ⋮ Metafinite model theory ⋮ Methods for proving completeness via logical reductions ⋮ Finite-model theory -- A personal perspective ⋮ Query languages for hierarchic databases ⋮ On the complexity of some problems on groups input as multiplication tables ⋮ On winning strategies in Ehrenfeucht-Fraïssé games ⋮ A restricted second order logic for finite structures ⋮ The closure of monadic NP
This page was built for publication:
