501 search results - page 32 / 101 » Communication Lower Bounds Using Dual Polynomials |
STOC
1996
ACM
15 years 2 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
90
Voted
ECCC
2011
14 years 5 months ago
2011
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
ALT
1995
Springer
15 years 1 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
COCO
2009
Springer
15 years 2 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 ...
96
Voted
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— 1 In this paper, pilot-assisted transmission over Gauss-Markov Rayleigh fading channels is considered. A simple scenario, where a single pilot signal is transmitted every T sym...