Login / Signup
An Upper Bound on the Time Complexity of Iterative-Deepening-A.
Brian G. Patrick
Mohammed Almulla
Monroe M. Newborn
Published in:
Ann. Math. Artif. Intell. (1992)
Keyphrases
</>
upper bound
iterative deepening
worst case
lower bound
evaluation function
state space search
search tree
memory efficient
branch and bound algorithm
computational complexity
depth first search
decision problems
tree search
branch and bound
neural network
special case
domain independent
np hard
search algorithm