Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
D
ds2-notes
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Deploy
Releases
Model registry
Analyze
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
datovky
ds2-notes
Commits
91c45d7a
Commit
91c45d7a
authored
5 years ago
by
Martin Mareš
Browse files
Options
Downloads
Patches
Plain Diff
Hashing: Fixed a typo in analysis of linear families
parent
240db80a
No related branches found
No related tags found
No related merge requests found
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
06-hash/hash.tex
+1
-1
1 addition, 1 deletion
06-hash/hash.tex
with
1 addition
and
1 deletion
06-hash/hash.tex
+
1
−
1
View file @
91c45d7a
...
...
@@ -199,7 +199,7 @@ Now, we turn back to the original linear family~$\cal L$.
\proof
We fix
$
x,y
\in
[
p
]
$
distinct and
$
i,j
\in
[
p
]
$
. To verify
$
(
2
,
4
)
$
-independence,
we need to prove that
$
\Pr
[
h
_{
a,b
}
(
x
)
=
i
\land
h
_{
a,b
}
(
x
)
=
j
]
\le
4
/
m
^
2
$
for a~random
we need to prove that
$
\Pr
[
h
_{
a,b
}
(
x
)
=
i
\land
h
_{
a,b
}
(
y
)
=
j
]
\le
4
/
m
^
2
$
for a~random
choice of parameters
$
(
a,b
)
$
.
As in the proof of universality of~
$
\cal
L
$
, we consider the bijection between
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment