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 preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anthony, M., Brightwell, G., Cohen, D., Shawe-Taylor, J.: On exact specification by examples. In: 5th Workshop on Computational learning theory, pp. 311–318 (1992)
Anthony, M., Hammer, P.: A Boolean Measure of Similarity. Discrete Applied Mathematics 154(16), 2242–2246 (2006)
Bondy, J.A.: Induced subsets. J. Combin. Theory (B) 12, 201–202 (1972)
Goldman, S.A., Kearns, M.J.: On the complexity of teaching. In: 4th Workshop on Computational learning theory, pp. 303–315 (1991)
Jukna, S.: Extremal Combinatorics Springer Texts in Theoretical Computer Science (2001)
Kushilevitz, E., Linial, N., Rabinovitch, Y., Saks, M.: Witness sets for families of binary vectors. J. Combin. Theory (A) 73, 376–380 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cohen, G., Randriam, H., Zémor, G. (2008). Witness Sets. In: Barbero, Á. (eds) Coding Theory and Applications. Lecture Notes in Computer Science, vol 5228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87448-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-87448-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87447-8
Online ISBN: 978-3-540-87448-5
eBook Packages: Computer ScienceComputer Science (R0)