Content deleted Content added
Line 118:
Huw: I agree. This paragraph is simply not true. I'm not even sure what <math>O(log(h*(x))</math> even means in this context since <math>x</math> represents a vertex in a graph and <math>O(f(n))</math> should imply that <math>f</math> is the dominant term in the cost of an algorithm when <math>n\rightarrow\infty</math>.
:<math>O(log(h^{*}(x))</math> is the asymptotic growth of the perfect heuristic <math>h^{*}</math>. I explained this and inserted a reference. Btw.,
| |||