P, NP, and NP-Completeness: the basics of computational complexity by Oded Goldreich

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.