A communication-randomness tradeoff for two-processor systems (Q1891144)
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 758659
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A communication-randomness tradeoff for two-processor systems |
scientific article; zbMATH DE number 758659 |
Statements
A communication-randomness tradeoff for two-processor systems (English)
0 references
28 May 1995
0 references
communication complexity
0 references
Las Vegas protocol
0 references
0.9111208319664
0 references
0.813152015209198
0 references
0.791321337223053
0 references
0.7902147769927979
0 references
