One-round multi-party communication complexity of distinguishing sums (Q391326)
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: One-round multi-party communication complexity of distinguishing sums |
scientific article; zbMATH DE number 6244161
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | One-round multi-party communication complexity of distinguishing sums |
scientific article; zbMATH DE number 6244161 |
Statements
One-round multi-party communication complexity of distinguishing sums (English)
0 references
10 January 2014
0 references
communication complexity
0 references
intrusion detection
0 references
additive combinatorics
0 references
one-round protocols
0 references
distinguishing sums
0 references
