Complexity of cover-preserving embeddings of bipartite orders into Boolean lattices (Q5499652)
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: Complexity of cover-preserving embeddings of bipartite orders into Boolean lattices |
scientific article; zbMATH DE number 6468258
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of cover-preserving embeddings of bipartite orders into Boolean lattices |
scientific article; zbMATH DE number 6468258 |
Statements
30 July 2015
0 references
NP-completeness
0 references
cover-preserving embeddings
0 references
bipartite orders
0 references
Boolean lattice
0 references
embeddability
0 references
COMPLEXITY OF COVER-PRESERVING EMBEDDINGS OF BIPARTITE ORDERS INTO BOOLEAN LATTICES (English)
0 references
0.8627610802650452
0 references
0.828914225101471
0 references
0.8067368865013123
0 references
0.7958440780639648
0 references
0.7860994338989258
0 references
