Parameterized Complexity of Fixed Variable Logics.

Christoph Berkholz Michael Elberfeld

Published in: FSTTCS (2014)

Keyphrases

parameterized complexity
fixed parameter tractable
computational problems
np hard
np complete
global constraints
conjunctive queries
modal logic
abstract argumentation
objective function
symmetry breaking
databases
incomplete information
multi attribute