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
Parents
49
1–5 of 49
94
5
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 94
61
Technion – Israel Institute of Technology
Haifa, Israel
4 h-index
8 publications
1.4K citations
Hebrew University of Jerusalem
Jerusalem, Israel
4 h-index
4 publications
142 citations
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
5 publications
113 citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
3 h-index
3 publications
116 citations

Cornell University
Ithaca, United States
3 h-index
4 publications
1.1K citations
Adolfo Ibáñez University
Santiago, Chile
2 h-index
2 publications
47 citations

University of Turku
Turku, Finland
2 h-index
3 publications
110 citations
Stanford University
Stanford, United States
2 h-index
2 publications
47 citations
1–8 of 61
5 publications · 159 citations
5
h-index
5 publications · 178 citations
5
h-index
3 publications · 645 citations
3
h-index
2 publications · 22 citations
2
h-index
Repository · 2 publications · 61 citations
2
h-index
1–5