8196 search results - page 67 / 1640 » Computational Modeling and Complexity Science |
143
click to vote
FOCS
2010
IEEE
15 years 1 months ago
2010
IEEE
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...
127
click to vote
CSR
2006
Springer
15 years 6 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...
132
click to vote
DLT
2009
15 years 24 days 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...
148
click to vote
STACS
2012
Springer
13 years 10 months ago
2012
Springer
Assignment between two parties in a two-sided matching market has been one of the central questions studied in economics, due to its extensive applications, focusing on different...
132
click to vote
DELOS
2004
15 years 4 months ago
2004
Databases and Grid computing are a good match. With the service orientation of Grid computing, the complexity of maintaining and integrating databases can be kept away from the act...