13603 search results - page 57 / 2721 » On the Computational Complexity of Cut-Reduction |
158
click to vote
CORR
2011
Springer
15 years 23 days 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...
184
click to vote
FOCS
2010
IEEE
15 years 3 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...
142
Voted
COGSCI
2004
15 years 5 months ago
2004
of natural language syntax often characterize grammatical knowledge as a form of abstract computation. This paper argues that such a characterization is correct, and that fundamen...