Average and randomized communication complexity (Q3481627)
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 4152297
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Average and randomized communication complexity |
scientific article; zbMATH DE number 4152297 |
Statements
Average and randomized communication complexity (English)
0 references
1990
0 references
communication complexity of a two-variable function
0 references
communication- complexity measures
0 references
computation errors
0 references
randomization
0 references
Boolean functions
0 references
0.9309608
0 references
0.9188998
0 references
0 references
0.91085255
0 references
0.9022081
0 references
0.89828587
0 references
0.8960832
0 references
0.89455783
0 references
