Talk:Las Vegas algorithm

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

???

This article has not yet received a rating on Wikipedia's content assessment scale.

???

This article has not yet received a rating on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

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)[reply]

Term Etymology?

I added a reference to the NIST Dictionary of Algorithms and Data Structures definition, although I'm not sure that's the best reference. Does anybody have any idea from where the term originated?

BTW, the NIST definition agrees a little more with "gambling with resources" in that for each run, for the same problem instance, the runtime resource requirements (time/space/etc) will possibly be different. But all programs, etc "gamble with resources", always assuming that there will be enough resources to solve any particular problem instance (and sometimes failing). So I agree, probably ought to consider better wording. Root4(one) 04:58, 12 January 2007 (UTC)[reply]