Lower bounds for one-way probabilistic communication complexity (Q4630264)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lower bounds for one-way probabilistic communication complexity |
scientific article; zbMATH DE number 7045117
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for one-way probabilistic communication complexity |
scientific article; zbMATH DE number 7045117 |
Statements
Lower bounds for one-way probabilistic communication complexity (English)
0 references
29 March 2019
0 references
Boolean function
0 references
communication complexity
0 references
communication matrix
0 references
probabilistic communication
0 references
0 references
0 references
0.9446569681167604
0 references
0.84210604429245
0 references
0.8091835975646973
0 references
0.808979332447052
0 references
