Some intriguing upper bounds for separating hash families (Q1729948)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some intriguing upper bounds for separating hash families |
scientific article; zbMATH DE number 7033402
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some intriguing upper bounds for separating hash families |
scientific article; zbMATH DE number 7033402 |
Statements
Some intriguing upper bounds for separating hash families (English)
0 references
7 March 2019
0 references
separating hash families
0 references
Johnson-type recursive bound
0 references
graph removal lemma
0 references
probabilistic method
0 references
0 references
0 references
0 references
0.8551082611083984
0 references
0.8328164219856262
0 references
0.8071609139442444
0 references
0.7989702820777893
0 references
0.7977790236473083
0 references
