computer-scienceangular-roadmapbackend-roadmapblockchain-roadmapdba-roadmapdeveloper-roadmapdevops-roadmapfrontend-roadmapgo-roadmaphactoberfestjava-roadmapjavascript-roadmapnodejs-roadmappython-roadmapqa-roadmapreact-roadmaproadmapstudy-planvue-roadmapweb3-roadmap
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
1.1 KiB
1.1 KiB
NP Complete
A problem is NP-complete if it is both NP and NP-hard. NP-complete problems are the hard problems in NP.
Visit the following resources to learn more:
- @article@Trying to understand P vs NP vs NP Complete vs NP Hard
- @video@Complexity: P, NP, NP-completeness, Reductions
- @video@P vs. NP and the Computational Complexity Zoo
- @video@Greedy Algs. II & Intro to NP Completeness
- @video@NP Completeness II & Reductions
- @video@NP Completeness III
- @video@NP Completeness IV