13603 search results - page 316 / 2721 » On the Computational Complexity of Cut-Reduction |
196
click to vote
EDBT
2006
ACM
15 years 10 months ago
2006
ACM
As data management applications grow more complex, they may need efficient distributed query processing, but also subscription management, data archival etc. To enact such applicat...
202
click to vote
NAACL
2010
15 years 4 months ago
2010
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
176
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—Building upon recent approaches for detection of impulse-radio ultra-wideband (IR-UWB) based on compressed sensing (CS), we combine this approach with techniques known from adva...
172
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
We clarify the role of Kolmogorov complexity in the area of randomness extraction. We show that a computable function is an almost randomness extractor if and only if it is a Kolm...
161
click to vote
CSR
2007
Springer
16 years 1 months ago
2007
Springer
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...