614 search results - page 35 / 123 » Local Computation: Lower and Upper Bounds |
MFCS
2004
Springer
15 years 3 months ago
2004
Springer
Given a fixed computable binary operation , we study the complexity of the following generation problem: The input consists of strings ½ Ò . The question is whether is in the c...
CCA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
PODC
2003
ACM
15 years 3 months ago
2003
ACM
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...
TIT
2011
14 years 5 months ago
2011
—This work first presents a general technique to compute tight upper and lower bounds on the information rate of a multiuser Rayleigh fading channel with no Channel State Inform...
SOFTWARE
2002
14 years 9 months ago
2002
Abstract. This paper presents a new approximation method for computing arguments or explanations in the context of logic-based argumentative or abductive reasoning. The algorithm c...