Monte Carlo Algorithm

From Generalized communication and security models in Byzantine agreement. Matthias Fitzi. 2002

A probabilistic algorithm with a polynomially upper-bounded computational worst-case complexity that, for all inputs, always computes a correct output with probability strictly greater than \(1/2\) is called probabilistic polynomial (PP) or an algorithm of type Monte Carlo.

From Wikipedia

In computing, a Monte Carlo algorithm is a randomized algorithm whose output may be incorrect with a certain (typically small) probability.