392 search results - page 16 / 79 » Reversal Complexity Revisited |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In this paper we prove that for any infinite word w whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
EJC
2010
13 years 7 months ago
2010
Abstract. We prove that the combinatorial distance between any two reduced expressions of a given permutation of {1, ..., n} in terms of transpositions lies in O(n4), a sharp bound...
KBSE
2009
IEEE
14 years 2 months ago
2009
IEEE
The current state of the art concerning the problem of service substitution raises the following issue: the complexity of the substitution process scales up with the number of ava...
SIGSOFT
2005
ACM
14 years 8 months ago
2005
ACM
Moose is a language-independent environment for reverseand re-engineering complex software systems. Moose provides a set of services including a common meta-model, metrics evaluat...