Family complexity and VC-dimension

Christian Mauduit, András Sárközy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationInformation Theory, Combinatorics, and Search Theory
Subtitle of host publicationIn Memory of Rudolf Ahlswede
EditorsHarout Aydinian, Christian Deppe, Ferdinando Cicalese
Pages346-363
Number of pages18
DOIs
Publication statusPublished - Apr 15 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7777
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • VC-dimension
  • family complexity
  • pseudorandom

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Family complexity and VC-dimension'. Together they form a unique fingerprint.

  • Cite this

    Mauduit, C., & Sárközy, A. (2013). Family complexity and VC-dimension. In H. Aydinian, C. Deppe, & F. Cicalese (Eds.), Information Theory, Combinatorics, and Search Theory: In Memory of Rudolf Ahlswede (pp. 346-363). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7777). https://doi.org/10.1007/978-3-642-36899-8-15