Space complexity of combinatorial search

MaRDI QIDQ2996248zbMATH OpenFDO

Authors Richard E. Korf

Publication date 6 May 2011

zbMATH Keywords

linear-space search algorithmsrecursive best-first search

Mathematics Subject Classification ID

Searching and sorting (68P10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Linear-space best-first search
• scientific article; zbMATH DE number 1882050
• Frontier search
• Breadth-first heuristic search
• Performance of linear-space search algorithms

Cited in

(8)

• Breadth-first heuristic search
• The complexity of searching implicit graphs
• On tree search algorithms
• Linear-time disk-based implicit graph search
• scientific article; zbMATH DE number 4164200 (Why is no real title available?)
• Frontier search
• The complexity of searching succinctly represented graphs
• scientific article; zbMATH DE number 1882050 (Why is no real title available?)

This page was built for publication: Space complexity of combinatorial search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2996248)