Login / Signup

Exploring Subexponential Parameterized Complexity of Completion Problems.

Pål Grønås DrangeFedor V. FominMichal PilipczukYngve Villanger
Published in: STACS (2014)
Keyphrases
  • parameterized complexity
  • optimal solution
  • search algorithm
  • np complete
  • decision problems