Оценки числовых параметров в ДНФ случайных частичных булевых функций

A number of Pattern Recognition problems an be reduced to the construction of prime, irredundant, or shortest disjunctive normal forms for partial Boolean functions. Knowledge of considered function metrical properties an facilitate finding optimal decision. The paper is devoted to numeric al parameter estimates of partial Boolean functions taking values 0 and 1 with probabilities $p$ and $q$ correspondingly. The lower and upper bounds on the length of the shortest DNF representation of such functions are obtained in the paper.

519.766, 519.768