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_L9.md
View File

@@ -38,7 +38,7 @@ Answer: The adversary can make the runtime of each operation $\Theta(n)$ by simp
We don't want the adversary to know the hash function based on just looking at the code.
Idea: Randomize the choice of the hash function.
Ideas: Randomize the choice of the hash function.
### Randomized Algorithm
@@ -57,7 +57,7 @@ $$O(n)=E[T(n)]$$ or some other probabilistic quantity.
#### Randomization can help
Idea: Randomize the choice of hash function $h$ from a family of hash functions, $H$.
Ideas: Randomize the choice of hash function $h$ from a family of hash functions, $H$.
If we randomly pick a hash function from this family, then the probability that the hash function is bad on **any particular** set $S$ is small.