Test mathjax

nancycyzl · May 4, 2024 · 789c9d0 · 789c9d0
1 parent 9b57f8b
commit 789c9d0
Showing 1 changed file with 5 additions and 5 deletions.
diff --git a/_posts/2024-03-04-Complexity (NP).md b/_posts/2024-03-04-Complexity (NP).md
@@ -9,10 +9,6 @@ tags:
     - Complexity
 ---
 
-Reference:
-1. https://www.baeldung.com/cs/p-np-np-complete-np-hard
-2. https://blog.csdn.net/huang1024rui/article/details/49154507
-
 ### Big-O notation for complexity
 
 - $O(1)$ - constant time
@@ -52,4 +48,8 @@ NPC问题的条件
 
 The solution cannot be verified in polynomial time. They are at least as hard as any other problem in NP.
 
-![[Pasted image 20240327223757.png|397]]
+![[Pasted image 20240327223757.png|397]]
+
+## Reference
+1. https://www.baeldung.com/cs/p-np-np-complete-np-hard
+2. https://blog.csdn.net/huang1024rui/article/details/49154507