When is Red-Blue Nonblocker Fixed-Parameter Tractable?
Serge GaspersJoachim GudmundssonMichael HortonStefan RümmelePublished in: LATIN (2018)
Keyphrases
- fixed parameter tractable
- parameterized complexity
- computational problems
- np hard
- np complete
- global constraints
- bounded treewidth
- conjunctive queries
- databases
- constraint satisfaction problems
- vertex set
- abstract argumentation
- optimal solution
- boolean functions
- reasoning tasks
- exact algorithms
- state space
- computational complexity
- database