Theory of Computational Complexity (Prentice Hall International Series in Computer Science)

4 avg rating
( 1 ratings by GoodReads )
 
9780139153808: Theory of Computational Complexity (Prentice Hall International Series in Computer Science)

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.

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

Top Search Results from the AbeBooks Marketplace

1.

Bovet, Daniel; Crescenzi, Pierluigi
Published by Prentice Hall PTR (1994)
ISBN 10: 0139153802 ISBN 13: 9780139153808
New Hardcover Quantity Available: 1
Seller
Ergodebooks
(RICHMOND, TX, U.S.A.)
Rating
[?]

Book Description Prentice Hall PTR, 1994. Hardcover. Book Condition: New. Bookseller Inventory # DADAX0139153802

More Information About This Seller | Ask Bookseller a Question

Buy New
74.53
Convert Currency

Add to Basket

Shipping: 3.22
Within U.S.A.
Destination, Rates & Speeds