The complexity of embedding orders into small products of chains

Olivier Raynaud (1) , Eric Thierry (2, 3)

1 LIMOS - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes
2 LIP - Laboratoire de l'Informatique du Parallélisme
3 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

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.

Mots clés: partially ordered sets; encodings; optimization

Domaines: Complexité [cs.CC]; Mathématique discrète [cs.DM]

Olivier Raynaud, Eric Thierry. The complexity of embedding orders into small products of chains. 2008. ⟨hal-00261826⟩