Asymptotics of the complexity of interval search on a Boolean cube in the class of balanced trees
Diskretnaya Matematika, Tome 16 (2004) no. 4, pp. 65-78
For a problem of interval search on the Boolean cube, we study the asymptotic behaviour of the average search time in the class of balanced tree circuits on sequences of positive integers $\{k_i\}$ under the assumption that $k_i$ are cardinalities of databases. We show that the asymptotic behaviour may differ on different sequences. We give a complete description of the class of possible behaviours. This research was supported by the Russian Foundation for Basic Research, grant 01–01–00748.
@article{DM_2004_16_4_a6,
author = {T. D. Blaivas},
title = {Asymptotics of the complexity of interval search on a {Boolean} cube in the class of balanced trees},
journal = {Diskretnaya Matematika},
pages = {65--78},
year = {2004},
volume = {16},
number = {4},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_2004_16_4_a6/}
}
T. D. Blaivas. Asymptotics of the complexity of interval search on a Boolean cube in the class of balanced trees. Diskretnaya Matematika, Tome 16 (2004) no. 4, pp. 65-78. http://geodesic.mathdoc.fr/item/DM_2004_16_4_a6/
[1] Blaivas T. D., “Optimalnoe reshenie zadachi intervalnogo poiska na bulevom kube v klasse sbalansirovannykh drevovidnykh skhem”, Intellektualnye sistemy (to appear)
[2] Blaivas T. D., “Reshenie zadachi intervalnogo poiska na bulevom kube”, Tezisy dokladov XIII Mezhdunarodnoi konferentsii “Problemy teoreticheskoi kibernetiki”, Kazan, 2002, 22
[3] Gasanov E. E., Kudryavtsev V. B., Teoriya khraneniya i poiska informatsii, Fizmatlit, Moskva, 2002 | Zbl