scientific article; zbMATH DE number 969067
From MaRDI portal
Publication:5284545
zbMATH Open0862.68056MaRDI QIDQ5284545FDOQ5284545
Authors: Detlef Seese 
Publication date: 26 May 1997
Title of this publication is not available (Why is that?)
Recommendations
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 (34)
- 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
- Quantified conjunctive queries on partially ordered sets
- An optimal construction of Hanf sentences
- Characterising bounded expansion by neighbourhood complexity
- Algorithmic problems and hierarchies of first-order languages
- First-order interpretations of bounded expansion classes
- Data-compression for parametrized counting problems on sparse graphs
- FO model checking on geometric graphs
- On the fixed-parameter tractability of parameterized model-checking problems
- A logical approach to locality in pictures languages
- FO model checking of geometric graphs
- 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
- 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
- Gaifman normal forms for counting extensions of first-order logic
- Reducing CMSO model checking to highly connected graphs
- An algorithmic meta-theorem for graph modification to planarity and FOL
- 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
- Parameterized complexity of fair vertex evaluation problems
- The complexity of first-order and monadic second-order logic revisited
- First-order queries on classes of structures with bounded expansion
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)
