Abstract
The standard complexity classes of Complexity Theory do not allow for direct classification of most of the problems solved by heuristic graph search algorithms. The reason is that, in their standard definition, complexity classes are specifically tailored to explicit, instead of implicit, graphs of state or problem reduction spaces. But the usual practice works to a large extent, in some areas of Computer Science, over implicit graphs. 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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
