Investigations of the efficiency of a parallel program for construction of the shortest covering of a Boolean matrix

DSpace/Manakin Repository

Show full item record

Title Investigations of the efficiency of a parallel program for construction of the shortest covering of a Boolean matrix
Autor: Adamus, Adam; Novikov, Sergey
URI: http://hdl.handle.net/11331/3394
Date: 2010
Źródło: Studia Informatica : systemy i technologie informacyjne. Nr 14 (2010), s. 67-76
Abstract: The paper presents results of investigations of the efficiency of a parallel program for the solution of the NP-complete problem of constructing of the shortest covering of a Boolean matrix. It was explored dependencies of the time of constructing of the shortest covering from the number processing processors of a cluster and from the dimension of a Boolean matrix.

Files in this item

The following license files are associated with this item:

This item appears in the following Collection(s)

Uznanie autorstwa-Na tych samych warunkach 3.0 Polska Except where otherwise noted, this item's license is described as Uznanie autorstwa-Na tych samych warunkach 3.0 Polska

Search DSpace


Advanced Search

Browse

My Account

Statistics