36781 search results - page 54 / 7357 » Parameterizing by the Number of Numbers |
DMTCS
2003
13 years 11 months ago
2003
Let h : N → Q be a computable function. A real number x is h-monotonically computable (h-mc, for short) if there is a computable sequence (xs) of rational numbers which converges...
AMC
2010
13 years 10 months ago
2010
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix pertur...
GC
2008
Springer
13 years 10 months ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
COMBINATORICS
2006
13 years 10 months ago
2006
We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n-1 3 . A known construction shows this number is best possible when n 1 mod...
DM
2006
13 years 10 months ago
2006
Let F be a family of translates of a fixed convex set M in Rn. Let (F) and (F) denote the transversal number and the independence number of F, respectively. We show that (F) (F) 8...