Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources (Q1102253)

From MaRDI portal
Revision as of 01:37, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)





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
    0 references
    1987
    0 references
    semi-random source
    0 references
    imperfect and correlated sources of randomness
    0 references
    communication complexity
    0 references

    Identifiers