P, NP, and NP-Completeness: The Basics of Complexity Theory

E123824 UNEXPLORED

"P, NP, and NP-Completeness: The Basics of Complexity Theory" is a foundational textbook by Oded Goldreich that introduces the core concepts, problems, and techniques of computational complexity theory, with a focus on the classes P, NP, and NP-complete problems.


Referenced by (1)
Subject (surface form when different) Predicate
Oded Goldreich
authorOf

Please wait…