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 (-5[1])bounds on the worst-case time complexity (-5[2])of algorithms with this (15[1])property. (*) Quotient (15[1])filters use a transformation with (15[1]-5[1])this property to hash keys to fingerprints. (15[1])By construction, the initial population in a (0[1])genetic algorithm has this (10[1])property, and Las Vegas algorithms take inputs (10[1]-5[1])of (10[1])this type. (10[1])In quicksort, (10[1])the choice of pivot (10[1])element is this type of input common in (10[1])non-deterministic algorithms. (10[1])For 10 points, guessing and checking generally take in what type of (10[1])input that may be (10[1])outputted by an RNG? (10[1])■END■ (10[6]0[4])