Item description for Complexity Theory: Exploring the Limits of Efficient Algorithms by R. Pruim Ingo Wegener...
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.
Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!
Availability 128 units. Availability accurate as of Jan 16, 2017 03:14.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.
Reviews - What do customers think about Complexity Theory: Exploring the Limits of Efficient Algorithms?
good graduate level text Sep 5, 2005
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.