ENGLISH

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

By Daniel P. Bovet , Pierluigi Crescenzi

Book information

Publisher
Prentice Hall PTR
Year
1994
ISBN
0139153802, 9780139153808
LCC
QA267.7 .B68 1994
Open Library ID
OL1420987M
Language
english
Format
PDF
Filesize
1 MB (1354468 bytes)
Pages
291\291
Topic
Computers
Time added
2011-06-04 13:46:07

Description

Reviewing in a systematic way the most significant results obtained in the study of computational complexity, this book follows a balanced approach which is partly algorithmic and partly structuralist, assuming a basic knowledge of computational theory, elementary logic and programming techniques. From an algorithmic point of view, Introduction to the Theory of Complexity presents many "natural" problems and limits their complexity by illustrating algorithms which solve them. From a structural point of view, the book concerned with properties of complexity classes, inclusions between classes, implications between several hypotheses about complexity classes, and identification of structural properties of problems that affect their computational complexity. In addition, the book contains a wealth of worked examples and numerous problems.

Similar books