The complexity of embedding orders into small products of chains - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2008

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.
Fichier principal
Vignette du fichier
edim.pdf (194.17 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00261826 , version 1 (10-03-2008)

Identifiants

  • HAL Id : hal-00261826 , version 1

Citer

Olivier Raynaud, Eric Thierry. The complexity of embedding orders into small products of chains. 2008. ⟨hal-00261826⟩
351 Consultations
254 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More