36 citations · 176 across the 38 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2014
Communication with Imperfectly Shared Randomness
Clément L. Canonne, Venkatesan Guruswami, Raghu Meka +1
The communication complexity of many fundamental problems reduces greatly when the communicating parties share randomness that is independent of the inputs to the communication tas…
cs.CC2014
Learning circuits with few negations
Eric Blais, Clément L. Canonne, Igor C. Oliveira +2
Monotone Boolean functions, and the monotone Boolean circuits that compute them, have been intensively studied in complexity theory. In this paper we study the structure of Boolean…