29908 search results - page 39 / 5982 » On the Complexity of |
RTA
2010
Springer
13 years 11 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
ESEM
2008
ACM
13 years 9 months ago
2008
ACM
Complexity is often hypothesized to be the enemy of software security. If this hypothesis is true, complexity metrics may be used to predict the locale of security problems and ca...
DLT
2008
13 years 9 months ago
2008
By the famous theorem of Morse and Hedlund, a word is ultimately periodic if and only if it has bounded subword complexity, i.e., for sufficiently large n, the number of factors of...
GLOBECOM
2008
IEEE
13 years 7 months ago
2008
IEEE
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
ENTCS
2006
13 years 7 months ago
2006
Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in componentbased systems, we ...