An upper bound on the time complexity of iterative-deepening-\(A^*\)
type: Item
instance of: scholarly article
title: An upper bound on the time complexity of iterative-deepening-\(A^*\)
zbMATH Open document ID: 1034.68556
DOI: 10.1007/BF01543478
author: Brian G. Patrick
author: M. Almulla
author: Monroe M. Newborn
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1997-05-13T00:00:00Z
Mathematics Subject Classification ID: 68T99
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1005845
zbMATH Keywords: state space trees
MaRDI profile type: Publication
cites work: Search Algorithms Under Different Kinds of Heuristics—A Comparative Study
cites work: Three approaches to heuristic search in networks
cites work: Generalized best-first search strategies and the optimality of A*
cites work: On the optimality of A
cites work: Probabilistic analysis of the complexity of A*
cites work: Depth-first iterative-deepening: An optimal admissible tree search
cites work: On the complexity of admissible search algorithms
cites work: A heuristic search algorithm with modifiable estimate
cites work: Q3856120
cites work: Knowledge versus search: a quantitative analysis using A*
cites work: Some Recent Results in Heuristic Search Theory
cites work: Q5626306
cites work: Heuristic search viewed as path finding in a graph
full work available at URL: https://doi.org/10.1007/bf01543478
OpenAlex ID: W2088359154
description: scientific article; zbMATH DE number 1005845