Beyond set disjointness: the communication complexity of finding the intersection (Q2943615)
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 6478398
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Beyond set disjointness: the communication complexity of finding the intersection |
scientific article; zbMATH DE number 6478398 |
Statements
Beyond set disjointness (English)
0 references
3 September 2015
0 references
big data
0 references
communication complexity
0 references
communication protocols
0 references
databases
0 references
distributed algorithms
0 references
0.8179997205734253
0 references
0.7979571223258972
0 references
0.7796368598937988
0 references
0.7773232460021973
0 references
0.7713722586631775
0 references
