From 4d9d304fd7dc31bdd316aa5be07e138a482aa1d2 Mon Sep 17 00:00:00 2001
From: Tyler Perkins <tperki17@kent.edu>
Date: Wed, 30 Mar 2022 15:00:01 -0400
Subject: [PATCH] Update for 30-03-22 15:00

---
 tech/algorithms.wiki | 4 ++++
 tech/p_vs_np.wiki    | 5 +++++
 2 files changed, 9 insertions(+)
 create mode 100644 tech/p_vs_np.wiki

diff --git a/tech/algorithms.wiki b/tech/algorithms.wiki
index 50c6f6a..d3834be 100644
--- a/tech/algorithms.wiki
+++ b/tech/algorithms.wiki
@@ -85,4 +85,8 @@ Different ways to store and operate on data, with differing efficiency
 * [[gcd]] - Find the GCD of two numbers
 * [[modular_exponentiation|Modular Exponentiation]] - Solve a^b mod n
 
+== Misc ==
+
+* [[p_vs_np]]
+
 [[index]]
diff --git a/tech/p_vs_np.wiki b/tech/p_vs_np.wiki
new file mode 100644
index 0000000..af9c6d7
--- /dev/null
+++ b/tech/p_vs_np.wiki
@@ -0,0 +1,5 @@
+= P vs NP =
+
+P vs NP is a major unsolved problem in CS.
+
+P is a problem that can be solved quickly, quickly meaning polynomial time.