2 search results - page 1 / 1 » On the Communication Complexity of Read-Once AC^0 Formulae |
89
Voted
COCO
2009
Springer
15 years 3 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
147
click to vote
CC
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...