Generalized Witness Sets
Gérard Cohen, Sihem Mesnager · 2011
Given a set C of q-ary n-tuples and c ∈ C, how many symbols of c suffice to distinguish it from the other elements in C? This is a generalization of an old combinatorial problem, on which we present (asymptotically tight) bounds and variations.