1242 search results - page 71 / 249 » A Computational Complexity Theory in Membrane Computing |
132
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
147
click to vote
DC
2000
15 years 5 months ago
2000
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...
130
click to vote
FUN
2007
Springer
16 years 4 days ago
2007
Springer
In this paper we investigate the relations between knitting and computer science. We show that the two disciplines share many concepts. Computer science, in particular algorithm th...
142
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
In [15] we introduced the information landscape as a new concept of a landscape. We showed that for a landscape of a small size, information landscape theory can be used to predic...
154
click to vote
MOBIHOC
2009
ACM
16 years 6 months ago
2009
ACM
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...