14699 search results - page 232 / 2940 » Complexity and Cognitive Computing |
79
Voted
DAC
2002
ACM
16 years 4 months ago
2002
ACM
116
Voted
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
122
click to vote
STACS
2010
Springer
15 years 7 months ago
2010
Springer
We completely characterise the computational complexity of the list homomorphism problem for graphs in combinatorial and algebraic terms: for every graph H the problem is either N...
137
Voted
CORR
2011
Springer
14 years 11 months ago
2011
Springer
—The standard algebraic decoding algorithm of cyclic codes [n, k, d] up to the BCH bound t is very efficient and practical for relatively small n while it becomes unpractical fo...
152
Voted
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...