scientific article; zbMATH DE number 969067
From MaRDI portal
Publication:5284545
zbMath0862.68056MaRDI QIDQ5284545
Publication date: 26 May 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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
Compactors for parameterized counting problems, Characterising bounded expansion by neighbourhood complexity, The complexity of first-order and monadic second-order logic revisited, A logical approach to locality in pictures languages, FO model checking on geometric graphs, Quantified conjunctive queries on partially ordered sets, Quantified Conjunctive Queries on Partially Ordered Sets, Computing dense and sparse subgraphs of weakly closed graphs, Efficient First-Order Model-Checking Using Short Labels, Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes, Compact labelings for efficient first-order model-checking, An optimal construction of Hanf sentences, Unnamed Item, Unnamed Item, Unnamed Item, Computing thejth solution of a first-order query, Unnamed Item, Dominating set is fixed parameter tractable in claw-free graphs, Practical algorithms for MSO model-checking on tree-decomposable graphs, Successor-Invariant First-Order Logic on Classes of Bounded Degree, First-Order Model-Checking in Random Graphs and Complex Networks, Model checking existential logic on partially ordered sets, Reducing CMSO model checking to highly connected graphs, Game-based notions of locality over finite models, On the fixed-parameter tractability of parameterized model-checking problems, Unnamed Item, Unnamed Item, The parameterized complexity of \(k\)-edge induced subgraphs, Unnamed Item, Unnamed Item, Uniformly Automatic Classes of Finite Structures, Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable, Editing to a graph of given degrees, Parameterized complexity of the anchored \(k\)-core problem for directed graphs
