2924 search results - page 43 / 585 » Lower Bounds in Distributed Computing |
ADHOCNOW
2008
Springer
13 years 10 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...
FOSSACS
2007
Springer
14 years 3 months ago
2007
Springer
A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web serv...
COCOON
2007
Springer
14 years 3 months ago
2007
Springer
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for classes of polynomials f that have too few partial derivatives for the techn...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
TCS
2002
13 years 8 months ago
2002
We investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, Non-Classical Logics, Model Theory and Computability, North-Holland, Amsterdam, 1977...