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