Las Vegas algorithm

In <a href="/facts/Computing/Kghtm9fX">computing</a>, a Las Vegas algorithm is a <a href="/facts/Randomized_algorithm/Fngl1zgk">randomized algorithm</a> that always gives <a href="/facts/Correctness_(computer_science)/m4yxw3gw">correct</a> results; that is, it always produces the correct result or it informs about the failure. However, the runtime of a Las Vegas algorithm differs depending on the input. The usual definition of a Las Vegas algorithm includes the restriction that the expected runtime be finite, where the expectation is carried out over the space of random information, or entropy, used in the algorithm. An alternative definition requires that a Las Vegas algorithm always terminates (is <a href="/facts/Effective_method/4kC9c5hE">effective</a>), but may output a <a href="/facts/Partial_function/0vJMw0Nm">symbol not part of the solution space</a> to indicate failure in finding a solution. The nature of Las Vegas algorithms makes them suitable in situations where the number of possible solutions is limited, and where verifying the correctness of a candidate solution is relatively easy while finding a solution is complex.
Systematic search methods for computationally hard problems, such as some variants of the <a href="/facts/Davis%E2%80%93Putnam_algorithm/EowmALMU">Davis–Putnam algorithm</a> for propositional satisfiability (SAT), also utilize non-deterministic decisions, and can thus also be considered Las Vegas algorithms.

Las Vegas algorithm open-in-new

Las Vegas algorithm