This article is cited in 2 papers

On the construction of irredundant coverings of an integer matrix

E. A. Dem'yanov^a, E. V. Dyukova<sup>b

a</sup> Public Opinion Foundation, ul. Obrucheva 26-2, Moscow, 119421, Russia
^b Dorodnicyn Computing Center, Russian Academy of Sciences, ul. Vavilova 40, Moscow, 119991, Russia

Abstract: New estimates are derived for the computational complexity of the problem of constructing irredundant coverings of an integer matrix (search for maximal conjunctions of a special logical function).

Key words: discrete recognition and classification procedures, irredundant covering of an integer matrix, asymptotically optimal algorithm, metric properties of a set of coverings, metric properties of disjunctive normal forms.

UDC: 519.712

Received: 26.06.2006

 English version: Computational Mathematics and Mathematical Physics, 2007, 47:3, 518–526

Bibliographic databases:

• 
• 
•