|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
17th Annual IEEE Symposium on Logic in Computer Science (LICS'02)
Copenhagen, Denmark
July 22-July 25
ISBN: 0-7695-1483-9
| ASCII Text | x | ||
| Stephen A. Cook, "Complexity Classes, Propositional Proof Systems, and Formal Theories," Logic in Computer Science, Symposium on, pp. 311, 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02), 2002. | |||
| BibTex | x | ||
| @article{ 10.1109/LICS.2002.10000, author = {Stephen A. Cook}, title = {Complexity Classes, Propositional Proof Systems, and Formal Theories}, journal ={Logic in Computer Science, Symposium on}, volume = {0}, year = {2002}, issn = {1043-6871}, pages = {311}, doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2002.10000}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Logic in Computer Science, Symposium on TI - Complexity Classes, Propositional Proof Systems, and Formal Theories SN - 1043-6871 SP EP A1 - Stephen A. Cook, PY - 2002 KW - null VL - 0 JA - Logic in Computer Science, Symposium on ER - | |||
Citation:
Stephen A. Cook, "Complexity Classes, Propositional Proof Systems, and Formal Theories," lics, pp.311, 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.