Show simple item record

1733

Proof Complexity and Beyond

dc.date.accessioned2019-10-24T15:34:09Z
dc.date.available2019-10-24T15:34:09Z
dc.date.issued2017
dc.identifier.urihttp://publications.mfo.de/handle/mfo/3601
dc.description.abstractProof complexity is a multi-disciplinary intellectual endeavor that addresses questions of the general form “how difficult is it to prove certain mathematical facts?” The current workshop focused on recent advances in our understanding of logic-based proof systems and on connections to algorithms, geometry and combinatorics research, such as the analysis of approximation algorithms, or the size of linear or semidefinite programming formulations of combinatorial optimization problems, to name just two important examples.
dc.titleProof Complexity and Beyond
dc.rights.licenseDieses Dokument darf im Rahmen von § 53 UrhG zum eigenen Gebrauch kostenfrei heruntergeladen, gelesen, gespeichert und ausgedruckt, aber nicht im Internet bereitgestellt oder an Außenstehende weitergegeben werden.de
dc.rights.licenseThis document may be downloaded, read, stored and printed for your own use within the limits of § 53 UrhG but it may not be distributed via the internet or passed on to external parties.en
dc.identifier.doi10.14760/OWR-2017-37
local.series.idOWR-2017-37
local.subject.msc68
local.subject.msc90
local.subject.msc03
local.sortindex1041
local.date-range13 Aug - 19 Aug 2017
local.workshopcode1733
local.workshoptitleProof Complexity and Beyond
local.organizersAlbert Atserias, Barcelona; Jakob Nordström, Stockholm; Toniann Pitassi, Toronto; Alexander Razborov, Chicago/Moscow
local.report-nameWorkshop Report 2017,37
local.opc-photo-id1733
local.publishers-doi10.4171/OWR/2017/37
local.ems-referenceAtserias Albert, Nordström Jakob, Pitassi Toniann, Razborov Alexander: Proof Complexity and Beyond. Oberwolfach Rep. 14 (2017), 2299-2361. doi: 10.4171/OWR/2017/37


Files in this item

Thumbnail
Report

This item appears in the following Collection(s)

Show simple item record