Talk:Las Vegas algorithm: Difference between revisions

Browse history interactively

← Previous edit

Content deleted Content added

VisualWikitext

Add topic

Revision as of 04:43, 6 December 2010 edit Dllu (talk \| contribs) Extended confirmed users 1,622 edits →Want more examples: new section ← Previous edit		Latest revision as of 01:56, 9 March 2024 edit undo Cewbot (talk \| contribs) Bots 8,373,726 edits m Maintain {{WPBS}}: 4 WikiProject templates. Remove 1 deprecated parameter: field. Tag: Talk banner shell conversion
(5 intermediate revisions by 5 users not shown)
Line 1: {{WikiProject ~~Computing~~banner shell\|class=Start\|~~importance=}}~~ {{WikiProject ~~Computer science\|class=start~~Computing\|importance=~~mid~~}} {{WikiProject Computer science\|importance=mid}} {{WikiProject Statistics\|importance=low}} {{WikiProject Mathematics\|importance=low}} }} 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 20 ⟶ 24: I should like to see more examples of Las Vegas algorithms. For instance, is [[bogosort]] a Las Vegas algorithm? Bogosort is very random but is supposed to ''eventually'' give the right solution. Right now, there is only one example of a Las Vegas algorithm in the article, and it isn't even particularly well-explained. I'm sure that adding more examples will make this article far more accessible to laymen. [[User:Purpy Pupple\|Purpy Pupple]] ([[User talk:Purpy Pupple\|talk]]) 04:43, 6 December 2010 (UTC) :Yes, bogosort is a simple example of a Las Vegas algorithm. You might want to create a new section with examples. Please, be [[WP:BOLD]] and edit the relevant part(s). [[User:Hermel\|Hermel]] ([[User talk:Hermel\|talk]])