Login / Signup
A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm.
Jeong Han Kim
Ravi Montenegro
Yuval Peres
Prasad Tetali
Published in:
ANTS (2008)
Keyphrases
</>
markov chain
worst case
dynamic programming
optimal solution
monte carlo
markov model
voronoi diagram
machine learning
steady state
monte carlo simulation
expectation maximization
probabilistic automata
markov processes
finite automata
upper bound
probabilistic model
objective function
learning algorithm