scientific article; zbMATH DE number 969067

zbMATH Open0862.68056MaRDI QIDQ5284545FDOQ5284545

Detlef Seese

Publication date: 26 May 1997

Title of this publication is not available (Why is that?)

zbMATH Keywords

logical language

Mathematics Subject Classification ID

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

Cited In (37)

• Compactors for parameterized counting problems
• Practical algorithms for MSO model-checking on tree-decomposable graphs
• Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes
• Parameterized complexity of the anchored \(k\)-core problem for directed graphs
• Title not available (Why is that?)
• First-Order Model-Checking in Random Graphs and Complex Networks
• Quantified conjunctive queries on partially ordered sets
• An optimal construction of Hanf sentences
• Title not available (Why is that?)
• Successor-Invariant First-Order Logic on Classes of Bounded Degree
• Title not available (Why is that?)
• Quantified Conjunctive Queries on Partially Ordered Sets
• Characterising bounded expansion by neighbourhood complexity
• Algorithmic problems and hierarchies of first-order languages
• FO model checking on geometric graphs
• On the fixed-parameter tractability of parameterized model-checking problems
• A logical approach to locality in pictures languages
• Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
• The parameterized complexity of \(k\)-edge induced subgraphs
• Title not available (Why is that?)
• Efficient First-Order Model-Checking Using Short Labels
• Title not available (Why is that?)
• Game-based notions of locality over finite models
• Computing thejth solution of a first-order query
• Computing dense and sparse subgraphs of weakly closed graphs
• Title not available (Why is that?)
• Reducing CMSO model checking to highly connected graphs
• Compact labelings for efficient first-order model-checking
• Uniformly Automatic Classes of Finite Structures
• Model checking on interpretations of classes of bounded local cliquewidth
• Dominating set is fixed parameter tractable in claw-free graphs
• Editing to a graph of given degrees
• The complexity of first-order and monadic second-order logic revisited
• Model checking existential logic on partially ordered sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Deciding first-order properties of locally tree-decomposable structures 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5284545)