Karp and Zhang used a parallel branch-and-bound algorithm with an input with this property to complete the node expansion step in dynamic task scheduling. The Karger-Stein minimum cut algorithm contracts a given graph by repeatedly taking an input with this property until only two nodes remain. Yao’s principle is typically used to prove lower bounds on the worst-case time complexity of algorithms with this property. (*) Quotient filters use a transformation with this property to hash keys to fingerprints. By construction, the initial population in a basic genetic algorithm has this property, and Las Vegas algorithms take inputs of this type. The inputs of the Box-Muller algorithm have this property, which may be achieved by using the output of methods like Marsaglia’s Super Duper or the Mersenne Twister. For 10 points, guessing and checking algorithms generally take in what type of input that may be outputted by an RNG? ■END■
ANSWER: randomized [accept random or randomly generated or pseudorandomly generated or randomly distributed; accept stochastic; accept uniformly distributed or discrete uniformly distributed]
<KJ, Other Science: Computer Science>
= Average correct buzz position