NP Completeness: Difference between revisions
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
=External= | =External= | ||
* 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 | |||
=Internal= | =Internal= | ||
* [[Algorithms#NP-complete_Problems|Algorithms]] | * [[Algorithms#NP-complete_Problems|Algorithms]] | ||
=Overview= | =Overview= | ||
<font color=darkkhaki>TODO</font> | <font color=darkkhaki>TODO</font> | ||