This page uses content from Wikipedia and is licensed under CC BY-SA.

An **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]}

**^**Richard A. Mollin (2003).*RSA and Public Key Cryptography*. CHAPMAN & HALL/CRC. p. 80.**^**William J Turner (May 2002).*Black Box Linear Algebra with the Linbox Library*(PDF). North carolina State University. p. 3. Retrieved 10 July 2014.

P ≟ NP | This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it. |