ИСТИНА |
Войти в систему Регистрация |
|
ИСТИНА ИНХС РАН |
||
In this paper a problem of Boolean functions representation using information graphs is considered. Some basic estimations of the representation complexity are outlined in this paper. It includes the estimation of Shannon function of Boolean function representation in the classes of information graphs and information trees. Also for nearly all Boolean functions the order of representation complexity is obtained for the class of information graphs. For the class of information trees the asymptotic form of complexity is determined.