An extremal problem on trees and database theory - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2005

An extremal problem on trees and database theory

Résumé

We consider an extremal problem on labelled directed trees and applications to database theory. Among others, we will show explicit keysystems on an underlying set of size $n$, that cannot be represented by a database of less than $2^{n(1-c\cdot \log \log n / \log n)}$ rows.
Fichier principal
Vignette du fichier
dmAE0158.pdf (168.87 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01184450 , version 1 (14-08-2015)

Identifiants

Citer

Gyula O.H. Katona, Krisztián Tichler. An extremal problem on trees and database theory. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.293-298, ⟨10.46298/dmtcs.3461⟩. ⟨hal-01184450⟩

Collections

TDS-MACS
52 Consultations
551 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More