740 search results - page 54 / 148 » Lower bounds for Buchsbaum* complexes |
CIE
2007
Springer
15 years 6 months ago
2007
Springer
We survey our current knowledge of circuit complexity of regular languages and we prove that regular languages that are in AC0 and ACC0 are all computable by almost linear size ci...
WG
1992
Springer
15 years 3 months ago
1992
Springer
The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove ...
CATS
2007
15 years 1 months ago
2007
A model for the problem of predicting the outputs of a process, based only on knowledge of previous outputs, is proposed in terms of a decision problem. The strength of this parti...
TCOM
2008
14 years 11 months ago
2008
This letter presents a new method to directly analyze and optimize symbol error rate (SER) performance of minimum decoding complexity (MDC) ABBA space-time block codes based on a t...
CEC
2005
IEEE
15 years 5 months ago
2005
IEEE
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...