✦ 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
DOI: 10.1163/1569392043272476

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Shannon function of the complexity o

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

✍ Blaivas, T. D. 📂 Article 📅 2006 🏛 Walter de Gruyter GmbH & Co. KG 🌐 English ⚖ 141 KB

The complexity of computing the behaviou

The complexity of computing the behaviour of lattice automata on infinite trees

✍ Lehmann, Karsten; Peñaloza, Rafael 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 386 KB

On reconstructive sets of vertices in th

On reconstructive sets of vertices in the Boolean cube

✍ Vasil’eva, A. Yu. 📂 Article 📅 2012 🏛 Pleiades Publishing 🌐 English ⚖ 496 KB

Complexity of Boolean functions in the c

Complexity of Boolean functions in the class of polarized polynomial forms

✍ N. A. Peryazev 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 149 KB

Intervals of balanced binary trees in th

Intervals of balanced binary trees in the Tamari lattice

✍ Samuele Giraudo 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 494 KB

On the complexity of branch-and-bound se

On the complexity of branch-and-bound search for random trees

✍ 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