123 Algorithmsand Computation
Texte intégral
Outline
Documents relatifs
[r]
In this article, we prove that the Minimum Mosaic problem given haplotype recombinants with no missing values is hard for an unbounded number of founders and propose some
We next observe two interesting facts about Baire sets that hold for some impor- tant, but special, spaces.. Example 3.4 shows that both conclusions may fail in a
I n the present paper we shall describe the intersection of more restricted families of non-quasiana- lytic classes of functions.. The class C L is said to
We first formulate without proof two remarks which are simple consequences of the definition of an extreme
If B is the family of continuous measures on some perfect compact metric space, Theorem 4.1 can of course be greatly improved: by the Baire Category Theorem, any dense G δ subset of
In the special case when the boundary of the domain G is diffeomor- phic to a 3-dimensional sphere, the fact that the closed complex tangential curve ⊂ S ⊂ ∂ G mentioned above does
Minimum vertex covering is a famous combinatorial problem for which we know a polynomial time approximation algorithm (PTAA) with a ratio equal to 2, namely the maximal
