Probabilistic analysis of the complexity of A*
type: Item
instance of: scholarly article
title: Probabilistic analysis of the complexity of A*
zbMATH Open document ID: 0447.68068
DOI: 10.1016/0004-3702(80)90045-4
author: Nam Huyn
author: Rina Dechter
author: Judea Pearl
published in: Artificial Intelligence
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T99
zbMATH DE Number: 3700232
zbMATH Keywords: heuristic searching
MaRDI profile type: Publication
full work available at URL: 0004-3702(80)90045-4
OpenAlex ID: W2011284942
cites work: An admissible and optimal algorithm for searching AND/OR graphs
cites work: The heuristic search under conditions of error
cites work: On the complexity of admissible search algorithms
cites work: On the optimality of A
cites work: Q5626306
cites work: Problem representations and formal properties of heuristic search
cites work: Q3856120
cites work: Q5727090
cites work: Q5538132
description: scientific article; zbMATH DE number 3700232