Privacy and Communication Complexity (Q4012449)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 64699
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Privacy and Communication Complexity |
scientific article; zbMATH DE number 64699 |
Statements
Privacy and Communication Complexity (English)
0 references
27 September 1992
0 references
private distributed computations
0 references
unication complexity
0 references
rounds complexity
0 references
multiparty private protocols
0 references
privately computable function
0 references
deterministic protocol
0 references
0.8431612253189087
0 references
0.8431612253189087
0 references
0.8370550274848938
0 references
0.8248920440673828
0 references
0.8184801936149597
0 references