Startseite The Shannon function of the complexity of interval search on the Boolean cube in the class of trees
Artikel
Lizenziert
Nicht lizenziert Erfordert eine Authentifizierung

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

  • T. D. Blaivas
Veröffentlicht/Copyright: 1. Juli 2006
Veröffentlichen auch Sie bei De Gruyter Brill
Discrete Mathematics and Applications
Aus der Zeitschrift Band 16 Heft 3

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 cardinality less in order than the cardinality of the Boolean cube we give the asymptotics of the logarithm of the Shannon function.

Published Online: 2006-07-01
Published in Print: 2006-07-01

Copyright 2006, Walter de Gruyter

Heruntergeladen am 3.10.2025 von https://www.degruyterbrill.com/document/doi/10.1515/156939206777970471/html
Button zum nach oben scrollen