文章基本信息

标题：Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk)
本地全文：下载
作者：Stephen A. Cook
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2012
卷号：16
页码：9-11
DOI：10.4230/LIPIcs.CSL.2012.9
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：This is a survey talk explaining the connection between the three items mentioned in the title.
关键词：Complexity Classes; Weak Formal Theories; Propositional Proof Systems