Talk:Las Vegas algorithm: Difference between revisions

Revision as of 22:51, 1 November 2022

Latest revision as of 01:56, 9 March 2024

(2 intermediate revisions by 2 users not shown)

Line 1:

{{WikiProject banner shell|class=Start|

{{WPBS|1=

{{WikiProject Computing|class=Start|importance=}}

{{WikiProject Computer science|class=start|importance=mid}}

{{WikiProject Statistics|class=start|importance=low}}

{{mathsWikiProject rating|class=startMathematics|importance=low|field=applied}}

}}

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'':

Line 19 ⟶ 18:

== Term Etymology? ==

I added a reference to the NIST [http://www.nist.gov/dads/ 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?

Bolches yarboclos atte Paok

BTW, the NIST definition agrees a little more with "gambling with resources" in that for each run, <em>for the same problem instance</em>, 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. [[User:Root4(one)|Root4(one)]] 04:58, 12 January 2007 (UTC)