From 6fa0a53b66310fb4e1a482323e753bef650d0218 Mon Sep 17 00:00:00 2001 From: Tyler Perkins Date: Wed, 30 Mar 2022 15:15:01 -0400 Subject: [PATCH] Update for 30-03-22 15:15 --- tech/p_vs_np.wiki | 7 +++++++ 1 file changed, 7 insertions(+) diff --git a/tech/p_vs_np.wiki b/tech/p_vs_np.wiki index af9c6d7..f8895fe 100644 --- a/tech/p_vs_np.wiki +++ b/tech/p_vs_np.wiki @@ -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]]