Nondeterministic Communication Complexity

Nondeterministic Communication Complexity is a measure in communication complexity theory that characterizes the minimum number of bits that two parties must exchange, in the presence of a nondeterministic proof, to verify the value of a function when each party knows only one part of the input.

49

Publications

4.6K

Citations

94

Authors

61

Institutions

Publications per year

2017–2026

4

Authors

94

  1. HK
    Hartmut Klauck

    Centre for Quantum Technologies, Singapore

    5 publications · 248 citations

    5

    h-index

  2. DD
    Danny Dolev

    Hebrew University of Jerusalem, Israel

    4 publications · 139 citations

    4

    h-index

  3. JH
    Juraj Hromkovic̆

    ETH Zurich, Switzerland

    4 publications · 132 citations

    4

    h-index

  4. MK
    Mauricio Karchmer

    Hebrew University of Jerusalem, Israel

    3 publications · 111 citations

    3

    h-index

  5. IA
    Ittai Abraham

    Hebrew University of Jerusalem, Israel

    3 publications · 1K citations

    3

    h-index

1–5 of 94

Venues

  1. SIAM Journal on Computing

    5 publications · 159 citations

    5

    h-index

  2. Theoretical Computer Science

    5 publications · 178 citations

    5

    h-index

  3. Journal of Computer and System Sciences

    3 publications · 645 citations

    3

    h-index

  4. 2

    h-index

  5. ArXiv.org

    Repository · 2 publications · 61 citations

    2

    h-index

1–5