Atlantic City algorithm
Page Module:Message box/ambox.css has no content.
 | Page Template:Hidden begin/styles.css has no content. You can help expand this article with text translated from the corresponding article in français. (June 2022) Click [show] for important translation instructions.
|
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
References
Page Template:Reflist/styles.css has no content.
- ^ a b Page Module:Citation/CS1/styles.css has no content.Bach, Eric; Shallit, Jeffrey (1996). Algorithmic Number Theory, Volume 1: Efficient Algorithms. Cambridge: MIT Press. p. 51-52. ISBN 0-262-02405-5.
- ^ Page Module:Citation/CS1/styles.css has no content.Mollin, Richard (2003). RSA and Public-Key Cryptography. Boca Raton: Chapman & Hall/CRC. p. 80. ISBN 1-58488-338-3.
