Sciweavers

13603 search results - page 57 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 4 months ago
On the Decoding Complexity of Cyclic Codes Up to the BCH Bound
—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...
Davide Schipani, Michele Elia, Joachim Rosenthal
FOCS
2010
IEEE
14 years 7 months ago
The Complexity of Distributions
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...
Emanuele Viola
COGSCI
2004
82views more  COGSCI 2004»
14 years 9 months ago
Restricting grammatical complexity
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...
Robert Frank
IFIPTCS
2010
14 years 7 months ago
Initial Segment Complexities of Randomness Notions
Schnorr famously proved that Martin-L
Rupert Hölzl, Thorsten Kräling, Frank St...
GC
2011
Springer
14 years 1 months ago
Algorithmic Folding Complexity
Jean Cardinal, Erik D. Demaine, Martin L. Demaine,...