Programming Books C Java PHP Python Learn more Browse Programming Books
Buy New
$71.96
Qty:1
  • List Price: $89.95
  • Save: $17.99 (20%)
Only 2 left in stock (more on the way).
Ships from and sold by Amazon.com.
Gift-wrap available.
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image

Complexity Theory: Exploring the Limits of Efficient Algorithms Hardcover – January 1, 2005


Amazon Price New from Used from
Hardcover
"Please retry"
$71.96
$62.28 $42.49
Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


NO_CONTENT_IN_FEATURE

Shop the new tech.book(store)
New! Introducing the tech.book(store), a hub for Software Developers and Architects, Networking Administrators, TPMs, and other technology professionals to find highly-rated and highly-relevant career resources. Shop books on programming and big data, or read this week's blog posts by authors and thought-leaders in the tech industry. > Shop now

Product Details

  • Hardcover: 308 pages
  • Publisher: Springer; 2005 edition (2005)
  • Language: English
  • ISBN-10: 3540210458
  • ISBN-13: 978-3540210450
  • Product Dimensions: 9.5 x 6.4 x 0.9 inches
  • Shipping Weight: 1.3 pounds (View shipping rates and policies)
  • Average Customer Review: 4.5 out of 5 stars  See all reviews (2 customer reviews)
  • Amazon Best Sellers Rank: #2,622,658 in Books (See Top 100 in Books)

Editorial Reviews

Review

From the reviews:

"This book should be important and useful for students of computer science as an introduction to complexity theory with an emphasis on randomized and approximation algorithms … . It contains 16 chapters and extends from the foundations of modern complexity theory to recent developments with implications for concrete applications. … The text is well written … and the translation is successful." (Gerhard Lischke, Mathematical Reviews, Issue 2006 j)

"Complexity theory is an extremely important and vivid field on the border of mathematics and computer science. … Ingo Wegener certainly created an appealing, well-written book that is a definite choice for the specialists and lecturers when an undergraduate or graduate student asks for guidance into this challenging new field of mathematics." (Péter Hajnal, Acta Scientiarum Mathematicarum, Vol. 71, 2005)

From the Back Cover

Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice:

New branches of complexity theory continue to arise in response to new algorithmic concepts, and its results - such as the theory of NP-completeness - have influenced the development of all areas of computer science.

The topics selected have implications for concrete applications, and the significance of complexity theory for today's computer science is stressed throughout.


More About the Author

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

Customer Reviews

4.5 out of 5 stars
5 star
1
4 star
1
3 star
0
2 star
0
1 star
0
See both customer reviews
Share your thoughts with other customers

Most Helpful Customer Reviews

5 of 5 people found the following review helpful By W Boudville HALL OF FAMETOP 1000 REVIEWERVINE VOICE on September 5, 2005
Format: Hardcover
Wegener's book seems best suited for a graduate level course in algorithms or complexity. This subject is one of the key conceptual underpinnings of computing. For those of you desirous of a deep understanding of the complexity of a problem or algorithm to solve a problem, then the text furnishes good explanations.

All the classic problems are here. Knapsack. Travelling salesperson. And various black box approaches. The key demarcation in the text is between a problem that is NP complete and one that can be solved in polynomial time. But a virtue of the book is that even with an NP complete problem, it may well be possible to derive approximate solutions that are polynomial complete.

It's certainly not a simple book. Some of the problems are very hard. But that leaves room for you to improve on the current methods of solving them.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
1 of 1 people found the following review helpful By Alex Kalinowski on August 18, 2010
Format: Hardcover
I came across this book in my university's library during my summer research project. What I like about this book is that each chapter begins with the most basic notions that you need, then quickly brings you to material that is worthy of mathematical research. I especially like the chapter on interactive proof systems and zero-knowledge proofs. After using this book over the summer, I will be purchasing a copy to use as a future reference.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

Customer Images


What Other Items Do Customers Buy After Viewing This Item?