Non-deterministic communication complexity with few witnesses (Q1337464)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Non-deterministic communication complexity with few witnesses
scientific article

    Statements

    Non-deterministic communication complexity with few witnesses (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 November 1994
    0 references
    communication protocols
    0 references
    communication complexity
    0 references
    Turing-complexity class
    0 references

    Identifiers