October 2018
Beginner to intermediate
398 pages
11h 1m
English
book
Hands-On Data Structures and Algorithms with Python - Second Edition
by Dr. Basant Agarwal, Benjamin Baka, David Julian
Content preview from Hands-On Data Structures and Algorithms with Python - Second Edition
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
Start your free trial
NP-Hard
A problem is NP-Hard if all other problems in NP can be polynomial-time-reducible, or mapped to it. It is at least as hard as the hardest problem in NP.