108 search results - page 10 / 22 » On the computational complexity of partial covers of Theta g... |
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...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
COLT
1993
Springer
13 years 12 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
SPAA
1993
ACM
13 years 12 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...