Witness sets
classification
🧮 math.CO
keywords
binarybitsboundscombinatorialdistinguishelementsgivenimprove
read the original abstract
Given a set C of binary n-tuples and c in C, how many bits of c suffice to distinguish it from the other elements in C? We shed new light on this old combinatorial problem and improve on previously known bounds.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.