[1]
Adamus, A. and 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 (May 2019), 67–76.