36781 search results - page 36 / 7357 » Parameterizing by the Number of Numbers |
ASIACRYPT
2007
Springer
13 years 11 months ago
2007
Springer
We describe how we reached a new factoring milestone by completing the first special number field sieve factorization of a number having more than 1024 bits, namely the Mersenne nu...
DM
2010
13 years 7 months ago
2010
The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm...
DM
2008
13 years 7 months ago
2008
We determine the number of alternating parity sequences that are subsequences of an increasing m-tuple of integers. For this and other related counting problems we find formulas th...
COMBINATORICS
2006
13 years 7 months ago
2006
Let G be a group acting faithfully on a set X. The distinguishing number of the action of G on X, denoted DG(X), is the smallest number of colors such that there exists a coloring...
DM
2006
13 years 7 months ago
2006
The forcing number of a perfect matching M of a graph G is the cardinality of the smallest subset of M that is contained in no other perfect matching of G. In this paper, we demon...