Login / Signup

Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems.

Ivan BliznetsMarek CyganPawel KomosaLukás MachMichal Pilipczuk
Published in: SODA (2016)
Keyphrases
  • parameterized complexity
  • lower bound
  • upper bound
  • knowledge base
  • objective function
  • computational complexity
  • fixed parameter tractable