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

Stephen A. Cook. Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk). In Patrick Cégielski, Arnaud Durand, editors, Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France. Volume 16 of LIPIcs, pages 9-11, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2012. [doi]

Abstract

Abstract is missing.