Algorithms, Complexity, Extensions, and Applications
by Weixiong Zhang.
New York, NY
Springer New York : Imprint : Springer
1999
(XVI, 201 pages 51 illustrations)
Search for problem solving --;Algorithms for state-space search --;Complexity of state-space search --;Complexity transitions --;Algorithm selection --;State-space transformation for approximate and flexible computation --;Forward estimation for game search --;A retrospective view --;Appendices --;Bibliography.
This book is particularly concerned with heuristic state-space search for combinatorial optimization. Primarily written for researchers in computer science, the author presupposes a basic familiarity with complexity theory, and it is assumed that the reader is familiar with the basic concepts of random variables and recursive functions.