Communication complexity of set-disjointness for all probabilities (Q2816409)
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 6618606
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Communication complexity of set-disjointness for all probabilities |
scientific article; zbMATH DE number 6618606 |
Statements
22 August 2016
0 references
communication complexity
0 references
set-disjointness
0 references
complexity classes
0 references
0.9538749
0 references
0.9371868
0 references
0.93448365
0 references
0.93448365
0 references
0.9275752
0 references
0.91392624
0 references
0.9092976
0 references
0 references
0.90012026
0 references
Communication complexity of set-disjointness for all probabilities (English)
0 references
