Editing Monte Carlo algorithm (section)

==Applications in computational number theory and other areas==
Well-known Monte Carlo algorithms include the Solovay–Strassen primality test, the [[Baillie–PSW primality test]], the [[Miller–Rabin primality test]], and certain fast variants of the [[Schreier–Sims algorithm]] in [[computational group theory]].

For algorithms that are a part of [[Stochastic optimization|Stochastic Optimization]] (SO) group of algorithms, where probability is not known in advance and is empirically determined, it is sometimes possible to merge Monte Carlo and such an algorithm "to have both probability bound calculated in advance and a Stochastic Optimization component."<ref name=":0" /> "Example of such an algorithm is [[Ant colony optimization algorithms|Ant Inspired]] Monte Carlo."<ref name=":0" /><ref name=":1">{{Cite journal |last1=Kudelić |first1=Robert |last2=Ivković |first2=Nikola |date=2019 |title=Ant inspired Monte Carlo algorithm for minimum feedback arc set |url=https://doi.org/10.1016/j.eswa.2018.12.021 |journal=Expert Systems with Applications |volume=122 |pages=108–117 |doi=10.1016/j.eswa.2018.12.021 |issn=0957-4174}}</ref> In this way, "drawback of SO has been mitigated, and a confidence in a solution has been established."<ref name=":0" /><ref name=":1" />