828 search results - page 12 / 166 » Bounded Hairpin Completion |
JDA
2007
13 years 7 months ago
2007
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
SIAMDM
1998
13 years 7 months ago
1998
In this paper we present and describe an improved version of the Zero-Neighbors algorithm, which we call the Zero-Coverings algorithm. We also present a method for finding a small...
AML
2007
13 years 7 months ago
2007
In this paper we naturally define when a theory has bounded quantifier elimination, or is bounded model complete. We give several equivalent conditions for a theory to have each...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
The logic of proofs is known to be complete for the semantics of proofs in PA. In this paper we present a refinement of this theorem, we will show that we can assure that all the ...
JGT
2008
13 years 7 months ago
2008
We consider the following question: how large does n have to be to guarantee that in any two-colouring of the edges of the complete graph Kn,n there is a monochromatic Kk,k? In th...