Adamus, A., & Novikov, S. (2019). Investigations of the efficiency of a parallel program for construction of the shortest covering of a Boolean matrix. Studia Informatica. System and Information Technology, 14(1-2), 67–76. Retrieved from https://czasopisma.uph.edu.pl/studiainformatica/article/view/542