501 search results - page 61 / 101 » Communication Lower Bounds Using Dual Polynomials |
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
GLOBECOM
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—Available network information is an important factor in determining network performance. In this paper, we study the basic limits on the amount of network information th...
COCO
2008
Springer
13 years 10 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
JGAA
2006
13 years 8 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...