Levelable Sets and the Algebraic Structure of Parameterizations

Research paper by Jouke Witteveen, Leen Torenvliet

Indexed on: 16 Jan '18Published on: 16 Jan '18Published in: arXiv - Computer Science - Logic in Computer Science


Asking which sets are fixed-parameter tractable for a given parameterization constitutes much of the current research in parameterized complexity theory. This approach faces some of the core difficulties in complexity theory. By focussing instead on the parameterizations that make a given set fixed-parameter tractable, we circumvent these difficulties. We isolate parameterizations as independent measures of complexity and study their underlying algebraic structure. Thus we are able to compare parameterizations, which establishes a hierarchy of complexity that is much stronger than that present in typical parameterized algorithms races. Among other results, we find that no practically fixed-parameter tractable sets have optimal parameterizations.