Talk:Las Vegas algorithm
From Wikipedia, the free encyclopedia
The following is given as the definition of Monte Carlo and Las Vegas by Babai, Cooperman, Finkelstein, Luks and Seress in Fast Monte Carlo Algorithms for Permutation Groups:
- A Monte Carlo algorithm is a randomized algorithm that may give a wrong answer or report failure
with guaranteed small probability
- A Las Vegas algorithm is a Monte Carlo algorithm that never gives a wrong answer.
Now this is a bit different than gambling with resource. It seems like ZPP can be defined with either polytime bounded Las Vegas algorithms or with expected polynomial time randomized decision algorithms, giving the same class, but by slightly different machinations. -Ozga 03:23, 5 April 2006 (UTC)