Introduction to the Theory of Complexity (Prentice Hall International Series in Computer Science) PDF
291 Pages·1994·1.292 MB·English
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.
Preview Introduction to the Theory of Complexity (Prentice Hall International Series in Computer Science)
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.
See more
The list of books you might like
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.
