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.
| Origine | Fichiers éditeurs autorisés sur une archive ouverte |
|---|
Loading...