Login / Signup

The Turing way to parameterized complexity.

Marco Cesati
Published in: J. Comput. Syst. Sci. (2003)
Keyphrases
  • parameterized complexity
  • fixed parameter tractable
  • global constraints
  • symmetry breaking
  • np complete
  • search algorithm