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