One-round multi-party communication complexity of distinguishing sums (Q391326): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1301.4269 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Communication Complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On data structures and asymmetric communication complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4284623 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4474047 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The communication complexity of addition / rank | |||
Normal rank | |||
Latest revision as of 04:47, 7 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | One-round multi-party communication complexity of distinguishing sums |
scientific article |
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
