From the W-hierarchy to XNLP: Classes of Fixed Parameter Intractability

Hans L. Bodlaender*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

2 Downloads (Pure)

Abstract

In this short survey, a number of old and new notions from parameterized complexity are discussed. We start with looking at the W-hierarchy, including the classes W[1], W[2], W[P]. Then, a recent development where problems are shown to be complete for simultaneously non-deterministic time of the form f(k) nc and space of the form f(k) log n, is discussed. Some consequences and other notions are briefly explored.

Original languageEnglish
Title of host publicationWALCOM: Algorithms and Computation
Subtitle of host publication16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022, Proceedings
EditorsPetra Mutzel, Md. Saidur Rahman, Slamin
Place of PublicationCham
PublisherSpringer
Pages15-25
Number of pages11
Edition1
ISBN (Electronic)978-3-030-96731-4
ISBN (Print)978-3-030-96730-7
DOIs
Publication statusPublished - 22 Feb 2022
Event16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022 - Jember, Indonesia
Duration: 24 Mar 202226 Mar 2022

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume13174
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022
Country/TerritoryIndonesia
CityJember
Period24/03/2226/03/22

Keywords

  • Parameterized complexity
  • W-hierarchy
  • XNLP
  • XP

Fingerprint

Dive into the research topics of 'From the W-hierarchy to XNLP: Classes of Fixed Parameter Intractability'. Together they form a unique fingerprint.

Cite this