2432 search results - page 11 / 487 » Degrees and choice numbers |
TAMC
2007
Springer
15 years 5 months ago
2007
Springer
We say that A ≤LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real γ, oracle B can also find patterns on ...
ARSCOM
2004
14 years 11 months ago
2004
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
APPML
2011
14 years 6 months ago
2011
The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove t...
MOC
2000
14 years 11 months ago
2000
We describe an adaptation of the number field sieve to the problem of computing logarithms in a finite field. We conjecture that the running time of the algorithm, when restricted ...
108
click to vote
SAC
2000
ACM
15 years 4 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...