Introduction to the Theory of Complexity (Prentice Hall International Series in Computer Science) - Hardcover

Bovet, Daniel P.; Crescenzi, Pierluigi

  • 3.80 out of 5 stars
    5 ratings by Goodreads
 
9780139153808: Introduction to the Theory of Complexity (Prentice Hall International Series in Computer Science)

Synopsis

Using a balanced approach that is partly algorithmic and partly structuralist, this book systematically reviews the most significant results obtained in the study of computational complexity theory. KEY TOPICS: Considers properties of complexity classes, inclusions between classes, implications between several hypotheses about complexity classes, and identification of structural properties of sets that affect their computational complexity. Features over 120 worked examples, over 200 problems, and 400 figures. For those interested in complexity and computability, algorithm design, operations research, and combinational mathematic.

"synopsis" may belong to another edition of this title.

From the Back Cover

Using a balanced approach that is partly algorithmic and partly structuralist, this book systematically reviews the most significant results obtained in the study of computational complexity theory. Considers properties of complexity classes, inclusions between classes, implications between several hypotheses about complexity classes, and identification of structural properties of sets that affect their computational complexity. Features over 120 worked examples, over 200 problems, and 400 figures. For those interested in complexity and computability, algorithm design, operations research, and combinational mathematic.

"About this title" may belong to another edition of this title.