209 search results - page 7 / 42 » The Computational Complexity of Weak Saddles |
APAL
2010
13 years 7 months ago
2010
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
DC
2008
13 years 7 months ago
2008
We study the feasibility and cost of implementing --a fundamental failure detector at the core of many algorithms--in systems with weak reliability and synchrony assumptions. Intui...
ATAL
2011
Springer
12 years 7 months ago
2011
Springer
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
We consider tree-walking automata using k pebbles. The pebbles are either strong (can be lifted from anywhere) or weak (can be lifted only when the automaton is on it). For each k,...
ISW
2007
Springer
14 years 1 months ago
2007
Springer
The stream ciphers Py, Py6 designed by Biham and Seberry were promising candidates in the ECRYPT-eSTREAM project because of their impressive speed. Since their publication in Apri...