Taking the union bound over the B bundles, and noting that 2 Ã— 0.073 2 > 0.01, we find that we can classify all of the bundles correctly with probability approaching one when t mul = (100 log B)(1 + o(1)), so that the total number of tests used is t mul B = (100B log B)(1 + o(1)).
this leads to the SSS algorithm described in Algorithm 3.