1538 search results - page 24 / 308 » Relative Randomness and Cardinality |
CRYPTO
1997
Springer
14 years 1 months ago
1997
Springer
: The McEliece public-key cryptosystem fails to protect any message which is sent to a recipient more than once using different random error vectors. In general, it fails to protec...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. Consider for an even d 4, a random d-regular graph model formed from d/2 uniform, independent permutat...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
We prove a strong Symmetry of Information relation for random strings (in the sense of Kolmogorov complexity) and establish tight bounds on the amount on nonuniformity that is nec...
APAL
2004
13 years 9 months ago
2004
We investigate the initial segment complexity of random reals. Let K( ) denote pre
SIAMCOMP
1998
13 years 9 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...