%0 Journal Article
%T Complexity of Cover-Preserving Embeddings of Bipartite Orders Into Boolean Lattices
%A Herman, Grzegorz
%J Reports on Mathematical Logic
%V 2014
%R 10.4467/20842589RM.14.006.2276
%N Number 49
%P 99-117

%@ 0137-2904
%D 2014
%U https://ejournals.eu/en/journal/reports-on-mathematical-logic/article/complexity-of-cover-preserving-embeddings-of-bipartite-orders-into-boolean-lattices
%X 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.