The complexity of embedding orders into small products of chains
Résumé
Embedding a partially ordered set into a product of chains is a classical way to encode it. We study two measures associated with two variations of optimal embeddings: the encoding dimension and the string dimension. We prove hardness results about their computations.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...