From 789c9d0846fa9b2e110e05dd34d2de64157e8c3a Mon Sep 17 00:00:00 2001 From: ZL_PC Date: Sat, 4 May 2024 10:28:12 +0800 Subject: [PATCH] Test mathjax --- _posts/2024-03-04-Complexity (NP).md | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/_posts/2024-03-04-Complexity (NP).md b/_posts/2024-03-04-Complexity (NP).md index 1b1206a..18933f2 100644 --- 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]] \ No newline at end of file +![[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 \ No newline at end of file