Atlantic City algorithm
In computing, an Atlantic City algorithm is a randomized algorithm that answers correctly at least 75% of the time .
≈ 3 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
|
In computing, an Atlantic City algorithm is a randomized algorithm that answers correctly at least 75% of the time[1]. In some variant definitions, the correctness threshold may be any value greater than 50%[2]. In either sense, Atlantic City algorithms are types of Monte Carlo algorithms.
There exists a polynomial-time Atlantic City algorithm for any problem belonging to the class BPP of bounded probabilistic polynomial-time problems[1].
Las Vegas algorithms, which never return an incorrect answer, are a dual of Monte Carlo algorithms and, therefore, of Atlantic City algorithms.
The name refers to Atlantic City in the U.S. state of New Jersey. Much like Monte Carlo and Las Vegas, Atlantic City is widely associated with casinos and gambling culture.
See also
edit edit sourceReferences
edit edit source- ^ a b Bach, Eric; Shallit, Jeffrey (1996). Algorithmic Number Theory, Volume 1: Efficient Algorithms. Cambridge: MIT Press. p. 51-52. ISBN 0-262-02405-5. Wikipedia revision 1341420723, retrieved 2026-11-19
- ^ Mollin, Richard (2003). RSA and Public-Key Cryptography. Boca Raton: Chapman & Hall/CRC. p. 80. ISBN 1-58488-338-3. Wikipedia revision 1341420723, retrieved 2026-11-19
Text derived from https://en.wikipedia.org/w/index.php?oldid=1341420723 under CC BY-SA 4.0; modifications have been made.