Publication:5365079
From MaRDI portal
zbMath1373.68273MaRDI QIDQ5365079
Saket Saurabh, Daniel Lokshtanov, Dániel Marx
Publication date: 29 September 2017
Full work available at URL: http://dl.acm.org/citation.cfm?id=2133096
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
