1920 search results - page 23 / 384 » The Complexity of the A B C Problem |
153
click to vote
PPDP
1999
Springer
15 years 10 months ago
1999
Springer
For a compiler writer, generating good machine code for a variety of platforms is hard work. One might try to reuse a retargetable code generator, but code generators are complex a...
176
click to vote
ISAAC
2007
Springer
15 years 12 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
129
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
161
click to vote
COCOA
2007
Springer
15 years 12 months ago
2007
Springer
Abstract. Multiple sequence alignment (MSA) is one of the most basic and central tasks for many studies in modern biology. In this paper, we present a new progressive alignment alg...
137
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of ...