[1]
A. Adamus and S. Novikov, “Investigations of the efficiency of a parallel program for construction of the shortest covering of a Boolean matrix”, SI, vol. 14, no. 1-2, pp. 67–76, May 2019, Accessed: Oct. 30, 2024. [Online]. Available: https://czasopisma.uws.edu.pl/studiainformatica/article/view/542