The Shannon function of the complexity of interval search on the Boolean cube in the class of trees

For the problem of interval search on the Boolean cube, we investigate the behaviour of the Shannon function in the class of tree-like circuits called information trees. It is shown that for databases of cardinality coinciding in order with cardinality of the Boolean cube the Shannon function is equal in order to the optimal complexity in the class of balanced tree-like circuits. For databases of…