In particular, it uses only intersections, which is always smaller than a s = |K 1 ∩ K 2 | available in the samples.
our algorithm takes advantage of all useful samples up to D s = min(max(K 1 ), max(K 2 )), particularly all a s intersections.