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

Fix typo

Browse Source 
Fix typos introduces more
This commit is contained in:
Zheyuan Wu
2024-12-03 11:20:59 -06:00
parent cbed1333ed
commit 9283c6b427
21 changed files with 213 additions and 44 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
pages/CSE347/CSE347_L7.md
View File

@@ -45,7 +45,7 @@ Assumption: No clause contains both a literal and its negation.
Need to: construct $S$ of positive numbers and a target $t$
Idea of construction:
Ideas of construction:
For 3-SAT instance $\Psi$:
@@ -276,7 +276,7 @@ Consider an instance of SSS: $\{ a_1,a_2,\cdots,a_n\}$ and sum $b$. We can creat
Then we prove that the scheduling instance is a "yes" instance if and only if the SSS instance is a "yes" instance.
Idea of proof:
Ideas of proof:
If there is a subset of $\{a_1,a_2,\cdots,a_n\}$ that sums to $b$, then we can schedule the jobs in that order on one machine.