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

Author Stephen A. Cook



PDF
Thumbnail PDF

File

LIPIcs.CSL.2012.9.pdf
  • Filesize: 253 kB
  • 3 pages

Document Identifiers

Author Details

Stephen A. Cook

Cite AsGet BibTex

Stephen A. Cook. Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk). In Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 16, pp. 9-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
https://doi.org/10.4230/LIPIcs.CSL.2012.9

Abstract

This is a survey talk explaining the connection between the three items mentioned in the title.
Keywords
  • Complexity Classes
  • Weak Formal Theories
  • Propositional Proof Systems

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail