Separating \(k\)-player from \(t\)-player one-way communication, with applications to data streams (Q6138070)
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: Separating k-player from t-player one-way communication, with applications to data streams |
scientific article; zbMATH DE number 7789150
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Separating \(k\)-player from \(t\)-player one-way communication, with applications to data streams |
scientific article; zbMATH DE number 7789150 |
Statements
16 January 2024
0 references
streaming
0 references
space complexity
0 references
Hamming norm
0 references
approximation
0 references
algorithms with predictions
0 references
direct sum
0 references
0 references
0.9960842728614808
0 references
0.8120778799057007
0 references
0.8057430386543274
0 references
0.7899162173271179
0 references
0.7602710723876953
0 references
