Time complexity of A^**
From MaRDI portal
Publication:5016595
Recommendations
- Remarks on the \(\mathrm A^{\ast\ast}\) algorithm
- The time complexity of \(A^*\) with approximate heuristics on multiple-solution search spaces
- A result on the computational complexity of heuristic estimates for the A^* algorithm
- scientific article; zbMATH DE number 67463
- New approaches for understanding the asymptotic complexity of \(A^*\) tree searching.
Cited in
(1)
This page was built for publication: Time complexity of \(A^{**}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5016595)