2026-07-28T21:27:31Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7037 2024-03-06T10:26:40Z ddc:004 open_access

Structure and Hardness in P (Dagstuhl Seminar 16451) Lewenstein, Moshe Pettie, Seth Vassilevska Williams, Virginia Algorithmic equivalences Classifying P Hardness assumptions Lower bounds 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Moshe Lewenstein and Seth Pettie and Virginia Vassilevska Williams 2017 Is Part Of Dagstuhl Reports, Volume 6, Issue 11 (2017) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.6.11.1 urn:nbn:de:0030-drops-70373 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.11.1 eng https://creativecommons.org/licenses/by/3.0/legalcode