Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources (Q1102253)
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 4049532
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources |
scientific article; zbMATH DE number 4049532 |
Statements
Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources (English)
0 references
1987
0 references
semi-random source
0 references
imperfect and correlated sources of randomness
0 references
communication complexity
0 references
0 references
0 references
0.8385916352272034
0 references
0.812603235244751
0 references
0.7678697109222412
0 references
0.7612007856369019
0 references
0.7547893524169922
0 references
