Robert Schaefer. P, NP, and NP-Completeness: the basics of computational complexity by Oded Goldreich. ACM SIGSOFT Software Engineering Notes, 36(1):37-38, 2011. [doi]
@article{Schaefer11a,
title = {P, NP, and NP-Completeness: the basics of computational complexity by Oded Goldreich},
author = {Robert Schaefer},
year = {2011},
doi = {10.1145/1921532.1921551},
url = {http://doi.acm.org/10.1145/1921532.1921551},
tags = {completeness},
researchr = {https://researchr.org/publication/Schaefer11a},
cites = {0},
citedby = {0},
journal = {ACM SIGSOFT Software Engineering Notes},
volume = {36},
number = {1},
pages = {37-38},
}