License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.7.1.103
URN: urn:nbn:de:0030-drops-72479
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/7247/
Go back to Dagstuhl Reports

Cygan, Marek ; Fomin, Fedor V. ; Hermelin, Danny ; Wahlström, Magnus
Weitere Beteiligte (Hrsg. etc.): Marek Cygan and Fedor V. Fomin and Danny Hermelin and Magnus Wahlström

Randomization in Parameterized Complexity (Dagstuhl Seminar 17041)

pdf-format:
dagrep_v007_i001_p103_s17041.pdf (0.8 MB)

Abstract

Dagstuhl Seminar 17041 "Randomization in Parameterized Complexity" took place from January 22nd to January 27th 2017 with the objective to bridge the gap between randomization and parameterized complexity theory. This report documents the talks held during the seminar as well as the open questions arised in the discussion sessions.

BibTeX - Entry

@Article{cygan_et_al:DR:2017:7247,
  author =	{Marek Cygan and Fedor V. Fomin and Danny Hermelin and Magnus Wahlstr{\"o}m},
  title =	{{Randomization in Parameterized Complexity (Dagstuhl Seminar 17041)}},
  pages =	{103--128},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2017},
  volume =	{7},
  number =	{1},
  editor =	{Marek Cygan and Fedor V. Fomin and Danny Hermelin and Magnus Wahlström},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7247},
  URN =		{urn:nbn:de:0030-drops-72479},
  doi =		{10.4230/DagRep.7.1.103},
  annote =	{Keywords: fixed-parameter tractability, intractability, parameterized complexity, randomness}
}

Keywords: fixed-parameter tractability, intractability, parameterized complexity, randomness
Collection: Dagstuhl Reports, Volume 7, Issue 1
Issue Date: 2017
Date of publication: 08.06.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI