@article{240ebddb-cf8c-4d2f-991c-806735b1e728, author = {Grzegorz Herman}, title = {Complexity of Cover-Preserving Embeddings of Bipartite Orders Into Boolean Lattices}, journal = {Reports on Mathematical Logic}, volume = {2014}, number = {Number 49}, year = {2014}, issn = {0137-2904}, pages = {99-117},keywords = {}, abstract = {We study the problem of deciding, whether a given partial order is embeddable into two consecutive layers of a Boolean lattice. Employing an equivalent condition for such em- beddability similar to the one given by J. Mittas and K. Reuter [5], we prove that the decision problem is NP-complete by showing a polynomial-time reduction from the not-all-equal variant of the Satisfiability problem.}, doi = {10.4467/20842589RM.14.006.2276}, url = {https://ejournals.eu/en/journal/reports-on-mathematical-logic/article/complexity-of-cover-preserving-embeddings-of-bipartite-orders-into-boolean-lattices} }