Family Complexity and VC-Dimension

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.
Document type :
Book sections
Liste complète des métadonnées
Contributor : Aigle I2m <>
Submitted on : Wednesday, February 10, 2016 - 4:02:15 PM
Last modification on : Monday, February 25, 2019 - 5:16:03 PM




Christian Mauduit, András Sárközy. Family Complexity and VC-Dimension. Information Theory, Combinatorics, and Search Theory, 7777 (II), pp.346-363, 2013, Lecture Notes in Computer Science, 978-3-642-36898-1. ⟨10.1007/978-3-642-36899-8_15⟩. ⟨hal-01272331⟩



Record views