16666 search results - page 266 / 3334 » Descriptive and Computational Complexity |
167
click to vote
CORR
2011
Springer
15 years 1 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...
202
click to vote
FOCS
2010
IEEE
15 years 4 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...
171
click to vote
RSP
2005
IEEE
16 years 5 days ago
2005
IEEE
Nowadays, Architecture Description Languages (ADLs) are getting popular to speed up the development of complex SoC design, by performing the design space explon a higher level of ...