Witness Sets for Families of Binary Vectors

Given a family ℛ ⊆ {0, 1}m of binary vectors of length m, as set W ⊆ {1,…,m} is called a witness set for r ∈ ℛ, if for all other r′ ∈ ℛ there exists a coordinate c ∈ W such that rc ≠ r′c. The smallest cardinality of a witness r ∈ ℛ is denoted w(r) = wℛ(r). In this note we show that ∑r∈ℛ w(r) = O(|ℛ|3/2) and constructions are given to show that this bound is tight. Further information is derived on the distribution of values of {w(r) | ∈ ℛ}.

[1]  Thomas M. Cover,et al.  Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition , 1965, IEEE Trans. Electron. Comput..

[2]  John Shawe-Taylor,et al.  On Specifying Boolean Functions by Labelled Examples , 1995, Discret. Appl. Math..

[3]  M. Kearns,et al.  On the complexity of teaching , 1991, COLT '91.

[4]  Translator-IEEE Expert staff Machine Learning: A Theoretical Approach , 1992, IEEE Expert.

[5]  R. Statman,et al.  Testing: an abstract approach , 1988, [1988] Proceedings. Second Workshop on Software Testing, Verification, and Analysis.

[6]  John Shawe-Taylor,et al.  On exact specification by examples , 1992, COLT '92.

[7]  Michael Kearns,et al.  On the complexity of teaching , 1991, COLT '91.