New approaches for understanding the asymptotic complexity of \(A^*\) tree searching. (Q1354031)
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: New approaches for understanding the asymptotic complexity of \(A^*\) tree searching. |
scientific article; zbMATH DE number 1005841
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New approaches for understanding the asymptotic complexity of \(A^*\) tree searching. |
scientific article; zbMATH DE number 1005841 |
Statements
New approaches for understanding the asymptotic complexity of \(A^*\) tree searching. (English)
0 references
13 May 1997
0 references
