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 (15[1])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 genetic algorithm has this (10[1])property, (10[2])and Las Vegas (10[1])algorithms take (10[1])inputs of this type. (10[3])In quicksort, (10[1])the choice of (10[1])pivot element (10[1])is this type of input common in (10[1])non-deterministic (10[2])algorithms. (10[1])For 10 points, guessing and checking generally (-5[1])take in what type of (10[1])input that may be (10[1])outputted by an RNG? (10[1])■END■ (10[5]0[1])