Category
page 1Randomized algorithms
Monte Carlo method
broad class of computational algorithms using random sampling to obtain numerical results
randomized algorithm
algorithm designed to use randomness from auxiliary inputs as part of its logic
algorithmic information theory
subfield of information theory and computer science
Las Vegas algorithm
randomized algorithm guaranteed to eventually produce correct or optimal results
probabilistic Turing machine
non-deterministic Turing machine which chooses between the available transitions at each point according to some probability distribution
Solovay–Strassen primality test
probabilistic primality test
Fisher–Yates shuffle
algorithm for generating a random permutation of a finite set
Monte Carlo algorithm
randomized algorithm with some probability of producing the wrong result
Baum–Welch algorithm
algorithm
probabilistically checkable proof
type of proof that can be checked by a randomized algorithm using a bounded amount of randomness and reading a bounded number of bits of the proof
random permutation
sequence where any order is equally likely
Reservoir sampling
Randomized algorithm
linear partial information
method of making decisions based on insufficient or fuzzy information
average-case complexity
Algorithm charcteristic in computations
PCP theorem
theorem in complexity theory that every problem in NP has probabilistically checkable proofs
Arthur–Merlin protocol
interactive proof system in computational complexity theory
Yao's principle
equivalence of average-case and expected complexity
Freivalds' algorithm
Randomized algorithm for verfiying matrix multiplication