Similar Items: The parameterized space complexity of model-checking bounded variable first-order logic
- The Complexity of Model Checking Higher-Order Fixpoint Logic
- On the Parameterized Intractability of Monadic Second-Order Logic
- Model Checking Spatial Logics for Closure Spaces
- Model-Checking Problems as a Basis for Parameterized Intractability
- Successor-Invariant First-Order Logic on Classes of Bounded Degree
- Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic