Near Optimal Bounds for Collision in Pollard Rho for Discrete Log.
Jeong Han KimRavi MontenegroPrasad TetaliPublished in: FOCS (2007)
Keyphrases
- upper bound
- lower bound
- collision avoidance
- worst case
- provably near optimal
- discrete version
- tight bounds
- lower and upper bounds
- collision detection
- discrete geometry
- sufficient conditions
- error bounds
- continuous data
- finite number
- discrete space
- translation invariant
- upper and lower bounds
- data sets
- evolutionary algorithm
- bayesian networks
- computer vision
- search engine
- neural network