Complexity Analysis of Admissible Heuristic Search
Complexity Analysis of Admissible Heuristic Search, by
Richard E. Korf
Proceedings of the National Conference on Artificial Intelligence (AAAI-98)
, Madison, WI, July, 1998, pp. 305-310.
We analyze the computational complexity of "Admissible Heuristic Search", under some reasonable hypotheses. An expanded version of our analysis appears in the paper
Time Complexity of Iterative-Deepening-
Updated January 8, 2008.