503 search results - page 41 / 101 » An Independence Relation for Sets of Secrets |
RELMICS
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. A Concurrent Kleene Algebra offers two composition operators, one that stands for sequential execution and the other for concurrent n [10]. In this paper we investigate ...
116
click to vote
JELIA
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Among others, Alferes et al. (1998) presented an approach for updating logic programs with sets of rules based on dynamic logic programs. We syntactically redefine dynami...
JSYML
2006
14 years 9 months ago
2006
Levin and Schnorr (independently) introduced the monotone complexity, Km(), of a binary string . We use monotone complexity to define the relative complexity (or relative randomnes...
DAM
2010
14 years 10 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
IWPC
2008
IEEE
15 years 4 months ago
2008
IEEE
The way in which a system’s software archive is partitioned influences the evolvability of that system. The partition of a software archive is mostly assessed by looking at the...