𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of admissible rules

✍ Scribed by Emil Jeřábek

Publisher
Springer
Year
2007
Tongue
English
Weight
302 KB
Volume
46
Category
Article
ISSN
0933-5846

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Proof theory for admissible rules
Proof theory for admissible rules
✍ Rosalie Iemhoff; George Metcalfe 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 887 KB
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