The Time Complexity of A* with Approximate Heuristics on Multiple-Solution Search Spaces (Q4899134)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Time Complexity of A* with Approximate Heuristics on Multiple-Solution Search Spaces |
scientific article; zbMATH DE number 6122393
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Time Complexity of A* with Approximate Heuristics on Multiple-Solution Search Spaces |
scientific article; zbMATH DE number 6122393 |
Statements
The Time Complexity of A* with Approximate Heuristics on Multiple-Solution Search Spaces (English)
0 references
7 January 2013
0 references
heuristics
0 references
search algorithms
0 references
time complexity of \(A^*\) search on trees
0 references
upper bounds
0 references
knapsack problem
0 references
partial Latin square problem
0 references
