We consider the problem on the realisation of Boolean functions by informational graphs. The exact expression of the Shannon function for the realisation in the class of tree-like informational graphs is obtained,. For almost all Boolean functions, we obtain the order of the complexity of the realisation by informational graphs and the asymptotics of complexity of the realisation by informational.
展开▼
