License
when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2012.9
URN: urn:nbn:de:0030-drops-36594
URL: http://drops.dagstuhl.de/opus/volltexte/2012/3659/
Cook, Stephen A.

Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk)

pdf-format:
Dokument 1.pdf (254 KB)

Abstract

This is a survey talk explaining the connection between the three items mentioned in the title.

BibTeX - Entry

@InProceedings{cook:LIPIcs:2012:3659,
  author =	{Stephen A. Cook},
  title =	{{Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk)}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{9--11},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{Patrick C{\'e}gielski and Arnaud Durand},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2012/3659},
  URN =		{urn:nbn:de:0030-drops-36594},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.CSL.2012.9},
  annote =	{Keywords: Complexity Classes, Weak Formal Theories, Propositional Proof Systems}
}

Keywords: Complexity Classes, Weak Formal Theories, Propositional Proof Systems
Seminar: Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL
Issue date: 2012
Date of publication: 27.08.2012

DROPS-Home | Fulltext Search | Imprint Published by LZI