Parameterized Complexity and Subexponential-Time Computability.

Jianer Chen Iyad A. Kanj

Published in: The Multivariate Algorithmic Revolution and Beyond (2012)

Keyphrases

parameterized complexity
global constraints
fixed parameter tractable
symmetry breaking
search algorithm
constraint satisfaction problems
random variables
bounded treewidth