13603 search results - page 18 / 2721 » On the Complexity of Computing Treelength |
COMPLEXITY
2010
13 years 6 months ago
2010
The increasing sophistication of the tools and results of cellular and molecular neuroscience would appear to suggest that explanatory force in neuroscience is defined by reductio...
CORR
2011
Springer
13 years 4 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...
FOCS
2010
IEEE
13 years 7 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...
IFIPTCS
2010
13 years 7 months ago
2010
Schnorr famously proved that Martin-L
GC
2011
Springer
13 years 15 days ago
2011
Springer