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]]