36781 search results - page 35 / 7357 » Parameterizing by the Number of Numbers |
EJC
2008
13 years 7 months ago
2008
The adaptable chromatic number of a graph G is the smallest integer k such that for any edge k-colouring of G there exists a vertex kcolouring of G in which the same colour never ...
COMBINATORICS
2007
13 years 7 months ago
2007
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...
CADE
2004
Springer
14 years 8 months ago
2004
Springer
STOC
2002
ACM
14 years 8 months ago
2002
ACM
ISSAC
1992
Springer
13 years 11 months ago
1992
Springer
We present some new classes of numbers that are easier to test for primality with the Elliptic Curve Primality Proving algorithm than average numbers. It is shown that this is the...