13621 search results - page 112 / 2725 » Computability and Complexity in Self-assembly |
TAMC
2010
Springer
14 years 3 months ago
2010
Springer
CSR
2006
Springer
14 years 1 months ago
2006
Springer
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...
DLT
2009
13 years 8 months ago
2009
Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k 2, is NP-hard [Theoret...
ITA
2006
13 years 10 months ago
2006
Abstract. We compare various computational complexity classes defined within the framework of membrane systems, a distributed parallel computing device which is inspired from the f...
IWPEC
2010
Springer
13 years 8 months ago
2010
Springer
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...