Abstract
Abstract The standard complexity classes of complexity theory do not allow for direct classification of most of the problems solved by heuristic search algorithms. The reason is that, almost always, these are defined in terms of implicit graphs of state or problem reduction spaces, while the standard definitions of all complexity classes are specifically tailored to explicit inputs. To allow for more precise comparisons with standard complexity classes, we introduce here a model for the analysis of algorithms on graphs given by vertex expansion procedures. It is based on previously studied concepts of “succinct representation” techniques, and allows us to prove PSPACE-completeness or EXPTIME-completeness of specific, natural problems on implicit graphs, such as those solved by A ∗ , AO ∗ , and other best-first search strategies.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
