POWER OF RANDOMNESS FOR COMMUNICATION COMPLEXITY.

    Research output: Contribution to journalArticle

    9 Scopus citations

    Abstract

    Improving a result of K. Mehlhorn and E. M. Schmidt, a function f with deterministic communication complexity n**2 is shown to have Las Vegas communication complexity O(n). This is the best possible, because the deterministic complexity cannot be more than the square of the Las Vegas communication complexity for any function.

    Original languageEnglish (US)
    Pages (from-to)178-181
    Number of pages4
    JournalConference Proceedings of the Annual ACM Symposium on Theory of Computing
    Publication statusPublished - 1987

      Fingerprint

    All Science Journal Classification (ASJC) codes

    • Software

    Cite this