7228 search results - page 79 / 1446 » From Algorithmic to Subjective Randomness |
112
click to vote
ALGORITHMICA
2005
15 years 3 months ago
2005
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
105
click to vote
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
124
click to vote
WEA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
116
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW]...
124
click to vote
RSA
2002
15 years 2 months ago
2002
In this paper we study the covariance structure of the number of nodes k and l steps away from the root in random recursive trees. We give an analytic expression valid for all k, ...