Seminar
Witness Sets, Hugues Randriam, Ecole Nationale Supèrieure des Telècomm., France, Tue, 30 March, 2009, 2:00 p.m. C-356
Abstract
Given a set C of binary n-tuples and c ∈ 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 is a joint work with Gèrard Cohen and Gilles Zèmor.