Discrete Recognition Procedures: The Complexity of Realization 1
E. V. Djukova · 2003
New results concerning the complexity of realization of the discrete recognition procedures that use irreducible coverings of Boolean matrices (the search for maximal conjunctions of monotonous Boolean func- tions) are discussed.