Get personalized book recommendations based on your reading history and preferences. Our algorithm analyzes your favorite books and reading patterns to suggest your next great read.

“NP-completeness” as a book category covers works about computational complexity and intractable problems, centering on decision problems whose solutions are quickly verifiable but for which no polynomial-time algorithms are known. Books in this genre explain the NP and NP-complete classes, polynomial-time reductions, the P vs. NP question, and the practical consequences of hardness for algorithm design. They typically survey canonical NP-complete problems (such as SAT, Traveling Salesman, Clique, and Vertex Cover), teach how to prove new problems NP-complete, and discuss coping strategies like heuristics, SAT/CSP solving, approximation algorithms, and parameterized methods. The category spans textbooks and reference catalogs (e.g., problem compendia), research monographs on hardness and approximability, and accessible popular-science accounts of the field’s history and impact.

Filter books by their publication year. Enter the earliest year (Start) and latest year (End) to find books published within that period. Leave either field empty to search from the beginning of time or up to the present day.