Divided into three parts, the book offers a comprehensive set of problems with solutions as well as in-depth case studies that demonstrate how to assess the complexity of a new problem.
Drawing on the authors’ classroom-tested material, this text takes readers step by step through the concepts and methods for analyzing algorithmic complexity. Through many problems and detailed examples, readers can investigate polynomial-time algorithms and NP-completeness and beyond.
Yves Robert, École Normale Supérieure de Lyon, Institut Universitaire de France, and Université de Lyon, France
Anne Benoit and Frederic Vivien, École Normale Supérieure de Lyon, France