182 search results - page 31 / 37 » A Theory of Strict P-completeness |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
TIT
1998
13 years 7 months ago
1998
—Given n discrete random variables = fX1;111; Xng, associated with any subset of f1; 2; 111; ng, there is a joint entropy H(X ) where X = fXi:i 2 g. This can be viewed as a f...
STACS
1994
Springer
13 years 11 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
PODC
2010
ACM
13 years 11 months ago
2010
ACM
We propose a natural generalisation of asynchronous bounded delay (ABD) network models. The commonly used ABD models assume a known bound on message delay. This assumption is ofte...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Notions of fairness have recently received increased attention in the context of resource allocation problems, pushed by diverse applications where not only pure utilitarian effic...