On the complexity of admissible search algorithms