pdf-format: |
|
@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 | |
Seminar: | Dagstuhl Reports, Volume 6, Issue 11 | |
Issue date: | 2017 | |
Date of publication: | 23.03.2017 |