Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources (Q1102253): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02579325 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2065392541 / rank | |||
Normal rank | |||
Latest revision as of 09:54, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources |
scientific article |
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
