problemsTo understand the class of polynomial-time solvable problems, we must first have a formalnotion of what a "problem" is. We define an abstract problem Q to be a binary relation on aset I of problem instances and a set S of problem solutions. For example, an instance forSHORTEST-PATH is a triple consisting of a graph and two vertices. A solution is a sequenceof vertice...

book is well written. Some of the English constructions make reading less smooth when non-American writers use non-idiomatic English, and this requires more effort for comprehension. The book provides a source of data about teratological testing not easily available in any compendium. Because these questions are becoming more prominent in the evaluation of dysmorphic children, the book will be ...