NP Completeness: Difference between revisions
Jump to navigation
Jump to search
| Line 8: | Line 8: | ||
* https://www.coursera.org/learn/algorithms-npcomplete/lecture/fxmkY/the-vertex-cover-problem | * https://www.coursera.org/learn/algorithms-npcomplete/lecture/fxmkY/the-vertex-cover-problem | ||
* https://www.coursera.org/learn/algorithms-npcomplete/lecture/2or0q/smarter-search-for-vertex-cover-i | * https://www.coursera.org/learn/algorithms-npcomplete/lecture/2or0q/smarter-search-for-vertex-cover-i | ||
* https://www.coursera.org/learn/algorithms-npcomplete/lecture/lPiFO/smarter-search-for-vertex-cover-ii | |||
=Internal= | =Internal= | ||
Revision as of 20:09, 25 November 2021
External
- https://www.coursera.org/learn/algorithms-npcomplete/lecture/8HT5O/polynomial-time-solvable-problems
- https://www.coursera.org/learn/algorithms-npcomplete/lecture/o1CGE/reductions-and-completeness
- https://www.coursera.org/learn/algorithms-npcomplete/lecture/vZ9Bc/definition-and-interpretation-of-np-completeness-i
- https://www.coursera.org/learn/algorithms-npcomplete/lecture/3JqiX/definition-and-interpretation-of-np-completeness-ii
- https://www.coursera.org/learn/algorithms-npcomplete/lecture/VZY2Z/the-p-vs-np-question
- https://www.coursera.org/learn/algorithms-npcomplete/lecture/jugfP/algorithmic-approaches-to-np-complete-problems
- https://www.coursera.org/learn/algorithms-npcomplete/lecture/fxmkY/the-vertex-cover-problem
- https://www.coursera.org/learn/algorithms-npcomplete/lecture/2or0q/smarter-search-for-vertex-cover-i
- https://www.coursera.org/learn/algorithms-npcomplete/lecture/lPiFO/smarter-search-for-vertex-cover-ii
Internal
Overview
TODO