The Probabilistic Communication Complexity of Set Intersection (Q4030193)
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 147024
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Probabilistic Communication Complexity of Set Intersection |
scientific article; zbMATH DE number 147024 |
Statements
The Probabilistic Communication Complexity of Set Intersection (English)
0 references
1 April 1993
0 references
probabilistic communication complexity
0 references
lower bound
0 references
set intersection
0 references
nondeterminism
0 references
0.9581214
0 references
0.9426179
0 references
0.9426179
0 references
0.94036734
0 references
0.9371868
0 references
0.9314538
0 references
0.9243373
0 references
0.91103107
0 references
0.91103107
0 references
