19320 search results - page 323 / 3864 » On the complexity of computing determinants |
189
click to vote
JFP
2000
15 years 6 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
179
click to vote
JUCS
2010
15 years 5 months ago
2010
: For many complex and dynamic ubiquitous services, context-aware cooperation can be a solution. However, the way is not yet clear to make individual objects cooperate with each ot...
174
click to vote
CIE
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
273
click to vote
ICDT
2009
ACM
16 years 7 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
156
click to vote
DNA
2009
Springer
16 years 1 months ago
2009
Springer
Recently we have shown how molecular logic circuits with many components arranged in multiple layers can be built using DNA strand displacement reactions. The potential application...