Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs
From MaRDI portal
Publication:2828227
DOI10.1145/2691321zbMath1347.68171MaRDI QIDQ2828227
Marcin Pilipczuk, Stefan Kratsch, Venkatesh Raman, Ashutosh Rai
Publication date: 24 October 2016
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2691321
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)