13603 search results - page 58 / 2721 » On the Computational Complexity of Cut-Reduction |
CHI
2010
ACM
15 years 28 days ago
2010
ACM
Sawtooth (2009) is an artwork integrating performance, sound, and animation. This paper describes the design of Sawtooth, with particular reference to the balances it strikes betw...
CSR
2006
Springer
15 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
14 years 7 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
14 years 9 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...
124
click to vote
IWPEC
2010
Springer
14 years 7 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...