Trance-0/NoteNextra-origin
1
0
Fork 0
Code Issues Pull Requests Actions 1 Packages Projects Releases Wiki Activity

update notations and fix typos

Browse Source
This commit is contained in:
Zheyuan Wu
2025-02-25 20:41:35 -06:00
parent 419ea07352
commit 27bff83685
71 changed files with 920 additions and 430 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
pages/CSE347/CSE347_L5.md
View File

@@ -161,7 +161,7 @@ $ISET(G,k)$ returns true if $G$ contains an independent set of size $\geq k$, a
Algorithm? NO! We think that this is a hard problem.
A lot of people have tried and could not find a poly-time solution
A lot of pQEDle have tried and could not find a poly-time solution
### Example: Vertex Cover (VC)