17541 search results - page 95 / 3509 » Complexity in scalable computing |
DAM
2006
14 years 12 months ago
2006
In the paper, the computational complexity of several variants of the problem of isothermic DNA sequencing by hybridization, is analyzed. The isothermic sequencing is a recent met...
IPL
2006
14 years 12 months ago
2006
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...
STOC
2010
ACM
15 years 4 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
124
click to vote
FUN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...