Randomized algorithmA randomized algorithm is an algorithm that employs a degree of randomness as part of its logic or procedure. The algorithm typically uses uniformly random bits as an auxiliary input to guide its behavior, in the hope of achieving good performance in the "average case" over all possible choices of random determined by the random bits; thus either the running time, or the output (or both) are random variables.
Sinc functionIn mathematics, physics and engineering, the sinc function, denoted by sinc(x), has two forms, normalized and unnormalized. In mathematics, the historical unnormalized sinc function is defined for x ≠ 0 by Alternatively, the unnormalized sinc function is often called the sampling function, indicated as Sa(x). In digital signal processing and information theory, the normalized sinc function is commonly defined for x ≠ 0 by In either case, the value at x = 0 is defined to be the limiting value for all real a ≠ 0 (the limit can be proven using the squeeze theorem).
