The following pages link to (Q4945215):
Displaying 21 items.
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- A descriptive complexity approach to the linear hierarchy. (Q1401413) (← links)
- Parameterized complexity of some prefix-vocabulary fragments of first-order logic (Q1799280) (← links)
- Describing parameterized complexity classes (Q1877556) (← links)
- The parameterized complexity and kernelization of resilience for database queries (Q2202009) (← links)
- Descriptive complexity of \#P functions: a new perspective (Q2220444) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- Descriptive complexity of deterministic polylogarithmic time (Q2303589) (← links)
- A linear-time kernelization for the rooted \(k\)-leaf outbranching problem (Q2354724) (← links)
- A general purpose algorithm for counting simple cycles and simple paths of any length (Q2415361) (← links)
- Experimental Descriptive Complexity (Q2897942) (← links)
- Structure and specification as sources of complexity (Q2920148) (← links)
- Parameterized Complexity of Fixed Variable Logics (Q2978506) (← links)
- Computation Models for Parameterized Complexity (Q4336699) (← links)
- Improvement on vertex cover for low-degree graphs (Q4506265) (← links)
- The ring grooming problem (Q4651930) (← links)
- The Descriptive Complexity of the Deterministic Exponential Time Hierarchy (Q5179012) (← links)
- On the complexity of Gödel's proof predicate (Q5190198) (← links)
- An analysis of the W*-hierarchy (Q5294024) (← links)
- Tractable answer-set programming with weight constraints: bounded treewidth is not enough (Q5410728) (← links)
- Parameterized Complexity of DPLL Search Procedures (Q5892172) (← links)
