The complexity of embedding orders into small products of chains (Q603886)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of embedding orders into small products of chains |
scientific article; zbMATH DE number 5813770
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of embedding orders into small products of chains |
scientific article; zbMATH DE number 5813770 |
Statements
The complexity of embedding orders into small products of chains (English)
0 references
8 November 2010
0 references
partially ordered sets
0 references
encodings
0 references
optimization
0 references
product of chains
0 references
encoding dimension
0 references
string dimension
0 references
computational complexity
0 references
0.7982551455497742
0 references
0.7677730917930603
0 references
0.7297369241714478
0 references
0.7204458713531494
0 references
