𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of algorithms on recursive trees

✍ Scribed by Jerzy Szymański

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
476 KB
Volume
74
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recursive reconstruction on periodic tre
Recursive reconstruction on periodic trees
✍ Elchanan Mossel 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB

A periodic tree T consists of full n-level copies of a finite tree T. The tree T n n is labeled by random bits. The root label is chosen randomly, and the probability of two adjacent vertices to have the same label is 1 y ⑀. This model simulates noisy propagation of a bit from the root, and has sign

On the complexity of admissible search a
On the complexity of admissible search algorithms
✍ Alberto Martelli 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 788 KB

This paper analyzes the complexity of heuristic search algorithms, Le. algorithms which find the shortest path in a graph by using an estimate to guide the search. In particular, .algorithm A\*, due to Hart, Nilsson and Raphael, is shown to require 0(2 ~) steps, in the worst cdse, for searching a gr

On the Complexity of Exclusion Algorithm
On the Complexity of Exclusion Algorithms for Optimization
✍ Eugene Allgower; Melissa Erdmann; Kurt Georg 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 133 KB

Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a function over a compact domain. The present paper discusses a new class of tests for such algorithms in the context of globa