NP Completeness: Difference between revisions
Jump to navigation
Jump to search
| Line 2: | Line 2: | ||
* https://www.coursera.org/learn/algorithms-npcomplete/lecture/8HT5O/polynomial-time-solvable-problems | * 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/o1CGE/reductions-and-completeness | ||
* https://www.coursera.org/learn/algorithms-npcomplete/lecture/vZ9Bc/definition-and-interpretation-of-np-completeness-i | |||
=Internal= | =Internal= | ||
Revision as of 18:43, 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
Internal
Overview
TODO