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.6.11.1
URN: urn:nbn:de:0030-drops-70373
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/7037/
Go back to Dagstuhl Reports

Lewenstein, Moshe ; Pettie, Seth ; Vassilevska Williams, Virginia
Weitere Beteiligte (Hrsg. etc.): Moshe Lewenstein and Seth Pettie and Virginia Vassilevska Williams

Structure and Hardness in P (Dagstuhl Seminar 16451)

pdf-format:
dagrep_v006_i011_p001_s16451.pdf (1 MB)

Abstract

This document contains description of the talks at the Dagstuhl seminar 16451 "Structure and Hardness in P". The main goal of the seminar was to bring together researchers from several disciplines and connect those who work on proving conditional lower bounds with those who or may benefit from it. This resulted in an extensive list of open problems which is also provided.

BibTeX - Entry

@Article{lewenstein_et_al:DR:2017:7037,
  author =	{Moshe Lewenstein and Seth Pettie and Virginia Vassilevska Williams},
  title =	{{Structure and Hardness in P (Dagstuhl Seminar 16451)}},
  pages =	{1--34},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2017},
  volume =	{6},
  number =	{11},
  editor =	{Moshe Lewenstein and Seth Pettie and Virginia Vassilevska Williams},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7037},
  URN =		{urn:nbn:de:0030-drops-70373},
  doi =		{10.4230/DagRep.6.11.1},
  annote =	{Keywords: Algorithmic equivalences, Classifying P, Hardness assumptions, Lower bounds}
}

Keywords: Algorithmic equivalences, Classifying P, Hardness assumptions, Lower bounds
Collection: Dagstuhl Reports, Volume 6, Issue 11
Issue Date: 2017
Date of publication: 23.03.2017

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