1.
Adamus A, Novikov S. Investigations of the efficiency of a parallel program for construction of the shortest covering of a Boolean matrix. SI [Internet]. 2019 May 13 [cited 2024 Oct. 30];14(1-2):67-76. Available from: https://czasopisma.uws.edu.pl/studiainformatica/article/view/542