𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The asymptotic behaviour of the complexity of the interval search on the Boolean cube in the class of balanced trees

✍ Scribed by Blaivas, T. D.


Book ID
120137524
Publisher
Walter de Gruyter GmbH & Co. KG
Year
2004
Tongue
English
Weight
100 KB
Volume
14
Category
Article
ISSN
0924-9265

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On the complexity of branch-and-bound se
✍ Luc Devroye; Carlos Zamora-Cura πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 256 KB πŸ‘ 2 views

Let T be a b-ary tree of height n, which has independent, non-negative, n identically distributed random variables associated with each of its edges, a model previously considered by Karp, Pearl, McDiarmid, and Provan. The value of a node is the sum of all the edge values on its path to the root. Co