Amazon.com: Introduction of the Theory of Complexity (Prentice Hall International Series in Computer Science) (0076092034988): Daniel Plerre Bovet, Plerlulgi Crescenzl, D. Bovet: Books

Sell Back Your Copy
For a $0.56 Gift Card
Trade in
Have one to sell? Sell yours here
Introduction of the Theory of Complexity (Prentice Hall International Series in Computer Science)
 
See larger image
 
Tell the Publisher!
I'd like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Introduction of the Theory of Complexity (Prentice Hall International Series in Computer Science) [Hardcover]

Daniel Plerre Bovet (Author), Plerlulgi Crescenzl (Author), D. Bovet (Author)


Available from these sellers.


Textbook Student FREE Two-Day Shipping for students on millions of items. Learn more


Book Description

April 1994 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.


Editorial Reviews

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.

Product Details

  • Hardcover: 330 pages
  • Publisher: Prentice Hall PTR (April 1994)
  • Language: English
  • ISBN-10: 0139153802
  • ISBN-13: 978-0139153808
  • Product Dimensions: 9.4 x 7 x 0.8 inches
  • Shipping Weight: 1.3 pounds
  • Amazon Best Sellers Rank: #1,549,767 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews


There are no customer reviews yet.
Video reviews
Video reviews
Amazon now allows customers to upload product video reviews. Use a webcam or video camera to record and upload reviews to Amazon.



What Other Items Do Customers Buy After Viewing This Item?


Tags Customers Associate with This Product

 (What's this?)
Click on a tag to find related items, discussions, and people.
 

Your tags: Add your first tag
 

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums



So You'd Like to...


Create a guide


Look for Similar Items by Category


Look for Similar Items by Subject