Stephen A. Cook. Complexity Classes, Propositional Proof Systems, and Formal Theories. In 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 22-25 July 2002, Copenhagen, Denmark, Proceedings. pages 311, IEEE Computer Society, 2002. [doi]
@inproceedings{Cook02:3, title = {Complexity Classes, Propositional Proof Systems, and Formal Theories}, author = {Stephen A. Cook}, year = {2002}, doi = {10.1109/LICS.2002.10000}, url = {http://doi.ieeecomputersociety.org/10.1109/LICS.2002.10000}, researchr = {https://researchr.org/publication/Cook02%3A3}, cites = {0}, citedby = {0}, pages = {311}, booktitle = {17th IEEE Symposium on Logic in Computer Science (LICS 2002), 22-25 July 2002, Copenhagen, Denmark, Proceedings}, publisher = {IEEE Computer Society}, isbn = {0-7695-1483-9}, }