Update for 30-03-22 15:00
This commit is contained in:
parent
6f79c61ae4
commit
4d9d304fd7
@ -85,4 +85,8 @@ Different ways to store and operate on data, with differing efficiency
|
|||||||
* [[gcd]] - Find the GCD of two numbers
|
* [[gcd]] - Find the GCD of two numbers
|
||||||
* [[modular_exponentiation|Modular Exponentiation]] - Solve a^b mod n
|
* [[modular_exponentiation|Modular Exponentiation]] - Solve a^b mod n
|
||||||
|
|
||||||
|
== Misc ==
|
||||||
|
|
||||||
|
* [[p_vs_np]]
|
||||||
|
|
||||||
[[index]]
|
[[index]]
|
||||||
|
5
tech/p_vs_np.wiki
Normal file
5
tech/p_vs_np.wiki
Normal file
@ -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.
|
Loading…
Reference in New Issue
Block a user