309 search results - page 35 / 62 » Communication Complexity Lower Bounds by Polynomials |
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
JACM
2008
13 years 7 months ago
2008
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
WCC
2005
Springer
14 years 1 months ago
2005
Springer
The security of the RSA public key cryptosystem depends on the intractability of the integer factoring problem. This paper shall give some theoretical support to the assumption of ...
MP
2007
13 years 7 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Traditional communication theory focuses on minimizing transmit power. However, communication links are increasingly operating at shorter ranges where transmit power can be signif...