The complexity of embedding orders into small products of chains
type: Item
instance of: scholarly article
title: The complexity of embedding orders into small products of chains
zbMATH Open document ID: 1205.06001
author: Olivier Raynaud
author: Eric Thierry
published in: Order
publication date: 2010-11-08T00:00:00Z
Mathematics Subject Classification ID: 06A06
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5813770
zbMATH Keywords: partially ordered sets
zbMATH Keywords: encodings
zbMATH Keywords: optimization
zbMATH Keywords: product of chains
zbMATH Keywords: encoding dimension
zbMATH Keywords: string dimension
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: s11083-009-9135-7
OpenAlex ID: W1997873539
cites work: Degrees of freedom versus dimension for containment orders
cites work: Q3741626
cites work: Q5532570
cites work: Q3222892
cites work: Q4525266
cites work: Q4692885
cites work: Drawing and encoding two-dimensional posets
cites work: Partially Ordered Sets
cites work: Q4338928
cites work: Q3046761
cites work: Geometric containment orders: A survey
cites work: On locally presented posets
cites work: String realizers of posets with applications to distributed computing
cites work: Q4525257
cites work: Computational aspects of the 2-dimension of partially ordered sets
cites work: The representation of posets and lattices by sets
cites work: Q5501778
cites work: Q3219752
cites work: On the pseudodimension of ordered sets
cites work: Q3291034
cites work: An improved algorithm for transitive closure on acyclic digraphs
cites work: Q4525259
cites work: An Efficient Data Structure for Lattice Operations
cites work: Embedding finite posets in cubes
cites work: Q4004146
cites work: Q3684157
cites work: The Complexity of the Partial Order Dimension Problem
DOI: 10.1007/S11083-009-9135-7
description: scientific article; zbMATH DE number 5813770