Grzegorz Herman
Reports on Mathematical Logic, Number 49, 2014, pp. 99-117
https://doi.org/10.4467/20842589RM.14.006.2276We 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.
Grzegorz Herman
Glottodidactic Journal, Issue 2 (2010) , 2010, pp. 137-145