1.
Novikov S. Parallel constructing of the shortest coverings of large Boolean matrices. SI. 2019;20(1-2):27-37. Accessed October 30, 2024. https://czasopisma.uws.edu.pl/studiainformatica/article/view/188