DagRep.6.11.1.pdf
- Filesize: 1.1 MB
- 34 pages
Document
Structure and Hardness in P (Dagstuhl Seminar 16451)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 6, Issue 11
Volume: Dagstuhl Reports, Volume 6
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2017-03-23
Cite AsGet BibTex
Moshe Lewenstein, Seth Pettie, and Virginia Vassilevska Williams. Structure and Hardness in P (Dagstuhl Seminar 16451). In Dagstuhl Reports, Volume 6, Issue 11, pp. 1-34, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/DagRep.6.11.1
https://doi.org/10.4230/DagRep.6.11.1
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.
Keywords
- Algorithmic equivalences
- Classifying P
- Hardness assumptions
- Lower bounds
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads