Abstract
In 2003 Ahlswede, Khachatrian, Mauduit and Sárközy introduced the notion of family complexity of binary sequences, and in 2006 Ahlswede, Mauduit and Sárközy extended this definition to sequences of k symbols. Since that several further related papers have been published on this subject. In this paper our main goal is to present a survey of all these papers. We will also answer a question of Csiszár and Gách on the connection of family complexity and VC-dimension. © Springer-Verlag Berlin Heidelberg 2013.
Author supplied keywords
Cite
CITATION STYLE
Mauduit, C., & Sárközy, A. (2013). Family complexity and VC-dimension. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7777, pp. 346–363). Springer Verlag. https://doi.org/10.1007/978-3-642-36899-8_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
