Witness Sets

Authors:
Gérard Cohen;Hugues Randriam;Gilles Zémor
Affiliations:
Ecole Nationale Supérieure des Télécommunications, Paris 13, France 75 634;Ecole Nationale Supérieure des Télécommunications, Paris 13, France 75 634;Institut de Mathématiques de Bordeaux, Université de Bordeaux, Talence, France 33405
Venue:
ICMCTA '08 Proceedings of the 2nd international Castle meeting on Coding Theory and Applications
Year:
2008

Citing 4
Cited 1

On the complexity of teaching

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
On exact specification by examples

COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Witness sets for families of binary vectors

Journal of Combinatorial Theory Series A
A Boolean measure of similarity

Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University

Separation and Witnesses

IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a set Cof binary n-tuples and c驴 C, how many bits of csuffice to distinguish it from the other elements in C? We shed new light on this old combinatorial problem and improve on previously known bounds.