The following pages link to (Q2762493):
Displaying 16 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Describing parameterized complexity classes (Q1877556) (← links)
- Parameterized random complexity (Q1946497) (← links)
- Parameterized complexity: the main ideas and connections to practical computing (Q2841253) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey (Q3586006) (← links)
- Model-Checking First-Order Logic: Automata and Locality (Q3608400) (← links)
- Model checking existential logic on partially ordered sets (Q4635604) (← links)
- (Q5002812) (← links)
- (Q5094135) (← links)
- (Q5144662) (← links)
- Satisfiability Checking of Non-clausal Formulas Using General Matings (Q5756567) (← links)
- First-Order Model-Checking in Random Graphs and Complex Networks (Q5874510) (← links)
- On Diagrams and General Model Checkers (Q5878893) (← links)