Login / Signup
Lower bounds for the parameterized complexity of Minimum Fill-in and other completion problems.
Ivan Bliznets
Marek Cygan
Pawel Komosa
Lukás Mach
Michal Pilipczuk
Published in:
CoRR (2015)
Keyphrases
</>
lower bound
parameterized complexity
database
upper bound
objective function
optimization problems
min sum
np complete
computational problems