Results 281 to 290 of about 5,642,848 (291)
Some of the next articles are maybe not open access.
The Probabilistic Communication Complexity of Set Intersection
SIAM Journal on Discrete Mathematics, 1992Bala Kalyanasundaram
exaly
Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness
Cybersecurity and Cyberforensics Conference, 2015Anup Rao, A. Yehudayoff
semanticscholar +1 more source
Lower Bounds for Quantum Communication Complexity
SIAM Journal on Computing, 2007Hartmut Klauck
exaly
A characterization of average case communication complexity
Information Processing Letters, 2007Martin Dietzfelbinger
exaly
Partition arguments in multiparty communication complexity
Theoretical Computer Science, 2011Eyal Kushilevitz
exaly
Fractional Covers and Communication Complexity
SIAM Journal on Discrete Mathematics, 1995Noam Nisan +2 more
exaly
Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness
SIAM Journal on Computing, 2018Jieming Mao +2 more
exaly

