Communication complexity of the secret key agreement in algorithmic information theory (Q5089211)
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: Communication complexity of the secret key agreement in algorithmic information theory |
scientific article; zbMATH DE number 7559415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Communication complexity of the secret key agreement in algorithmic information theory |
scientific article; zbMATH DE number 7559415 |
Statements
18 July 2022
0 references
Kolmogorov complexity
0 references
mutual information
0 references
communication complexity
0 references
expander mixing lemma
0 references
finite geometry
0 references
0 references
0 references
0.914440929889679
0 references
0.9122507572174072
0 references
0.7894291877746582
0 references
0.7850156426429749
0 references
