1132 search results - page 30 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
ADHOCNOW
2008
Springer
13 years 8 months ago
2008
Springer
In this paper, we consider the effects on network capacity when the nodes of an ad hoc network are allowed to cooperate. These results are then compared to the theoretical upper b...
ASIACRYPT
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
CIE
2006
Springer
13 years 11 months ago
2006
Springer
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
Boolean functions on the space Fm 2 are not only important in the theory of error-correcting codes, but also in cryptography. In these two cases, the nonlinearity of these functio...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. This paper extends previously proposed bound propagation algorithm [11] for computing lower and upper bounds on posterior marginals in Bayesian networks. We improve the b...