1.
Adamus A, Novikov S. Investigations of the efficiency of a parallel program for construction of the shortest covering of a Boolean matrix. SI. 2019;14(1-2):67-76. Accessed December 4, 2024. https://czasopisma.uws.edu.pl/studiainformatica/article/view/542