Atlantic City algorithm
- View a machine-translated version of the French article.
- Machine translation, like DeepL or Google Translate, is a useful starting point for translations, but translators must revise errors as necessary and confirm that the translation is accurate, rather than simply copy-pasting machine-translated text into the English Wikipedia.
- Consider adding a topic to this template: there are already 1,433 articles in the main category, and specifying
|topic=
will aid in categorization. - Do not translate text that appears unreliable or low-quality. If possible, verify the text with references provided in the foreign-language article.
- You must provide copyright attribution in the edit summary accompanying your translation by providing an interlanguage link to the source of your translation. A model attribution edit summary is
Content in this edit is translated from the existing French Wikipedia article at [[:fr:Algorithme d'Atlantic City]]; see its history for attribution.
- You may also add the template
{{Translated|fr|Algorithme d'Atlantic City}}
to the talk page. - For more guidance, see Wikipedia:Translation.
Atlantic City algorithm is a probabilistic polynomial time algorithm that answers correctly at least 75% of the time (or, in some versions, some other value greater than 50%). The term "Atlantic City" was first introduced in 1982 by J. Finn in an unpublished manuscript entitled Comparison of probabilistic tests for primality.[1]
Two other common classes of probabilistic algorithms are Monte Carlo algorithms and Las Vegas algorithms. Monte Carlo algorithms are always fast, but only probably correct. On the other hand, Las Vegas algorithms are always correct, but only probably fast. The Atlantic City algorithms, which are bounded probabilistic polynomial time algorithms are probably correct and probably fast.[2]
See also
- Monte Carlo Algorithm
- Las Vegas Algorithm
References
- v
- t
- e