207 search results - page 3 / 42 » The complexity of agreement |
MFCS
1990
Springer
13 years 10 months ago
1990
Springer
We introduce the notion of associative one-way functions and prove that they exist if and only if P 6= NP. As evidence of their utility, we present two novel protocols that apply ...
IPL
2010
13 years 4 months ago
2010
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
DLOG
2007
13 years 8 months ago
2007
We now know that the addition of a concept constructor called a Path Functional Dependency (PFD) to the Boolean-complete description logic DLF leads to undecidability of ABox consi...
ATAL
2007
Springer
13 years 10 months ago
2007
Springer
Multi-Agent Agreement problems (MAP) - the ability of a population of agents to search out and converge on a common state - are central issues in many multi-agent settings, from d...
ASIACRYPT
2004
Springer
13 years 11 months ago
2004
Springer
d abstract) Bartosz Przydatek1 and Reto Strobl2 1 Department of Computer Science, ETH Z¨urich, Switzerland 2 IBM Research, Zurich Research Laboratory, Switzerland In this paper, w...