Update for 30-03-22 15:15

This commit is contained in:
Tyler Perkins 2022-03-30 15:15:01 -04:00
parent 4d9d304fd7
commit 6fa0a53b66

View File

@ -3,3 +3,10 @@
P vs NP is a major unsolved problem in CS.
P is a problem that can be solved quickly, quickly meaning polynomial time.
NP is a problem that cannot be solved in polynomial time, but a correct
solution can be verified in polynomial time.
== Also see ==
* Polynomial time Reduction aka [[dynamic_programming]]