70 search results - page 4 / 14 » An Undecidable Linear Order That Is n-Decidable for All n |
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
WABI
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
DAM
2011
13 years 2 months ago
2011
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
JAT
2007
13 years 7 months ago
2007
Let LN+1 be a linear differential operator of order N + 1 with constant coefficients and real eigenvalues 1, . . . , N+1, let E( N+1) be the space of all C∞-solutions of LN+1 o...
CIE
2007
Springer
14 years 1 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...