New answers tagged probabilistic-algorithms
1
vote
Accepted
What is the largest "allowed" seed for a PRNG to not give any extra power to a deterministic machine?
I think there must be some confusion in the problem setting. Given an input of $n$ bits chosen uniformly at random, there is no algorithm to compress it to something whose length is on average ...

D.W.♦
- 156k
1
vote
How many random bits does this algorithm use on average?
I don't have a formal proof, but I expect the expected value is $\lg n + O(1)$ bits. In particular, heuristically I am expecting something like $\lg n + 2.9$ bits or so (but I don't trust that the ...

D.W.♦
- 156k
Top 50 recent answers are included
Related Tags
probabilistic-algorithms × 208algorithms × 54
probability-theory × 50
complexity-theory × 45
randomized-algorithms × 26
graphs × 15
data-structures × 15
time-complexity × 12
algorithm-analysis × 12
complexity-classes × 11
randomness × 10
hashing × 9
bloom-filters × 9
turing-machines × 8
approximation × 7
hash × 7
combinatorics × 6
hash-tables × 6
sorting × 5
quantum-computing × 5
sampling × 5
markov-chains × 5
monte-carlo × 5
chernoff-bounds × 5
computability × 4