Providing a comprehensive set of problem studies that builds on the authors' expertise and class-tested material, this useful manual offers a guided exploration of methods and techniques to assess problem complexity in the study and design of algorithms. The first part of the text presents background material on the study of algorithms and algorithm design, addressing such basic paradigms as divide-and-conquer, dynamic programming, and greedy algorithms. It also covers NP-completeness and beyond NP-completeness, including approximation results. The second part of the text is devoted to case studies that exploit tools and techniques for assessing problem complexity.
- ISBN:
- 9781439825648
- 9781439825648
-
Category:
- Computer science
- Format:
- Hardback
- Publication Date:
-
27-08-2013
- Language:
- English
- Publisher:
- Taylor & Francis Inc
- Country of origin:
- United States
- Pages:
- 380
- Dimensions (mm):
- 234x156x18mm
- Weight:
- 0.66kg
Our Australian supplier has this title on order. You can place a backorder for this title now and we will ship it to you when it becomes available.
While we are unable to provide a delivery estimate, most backorders will be delivered within 120 days. If we are informed by our supplier that the title is no longer available during this time, we will cancel and refund you for this item. Likewise, if no delivery estimate has been provided within 120 days, we will contact our supplier for an update. If there is still no delivery estimate we will then cancel the item and provided you with a refund.
If we are able to secure you a copy of the title, our supplier will despatch it to our Sydney warehouse. Once received we make sure it is in perfect condition and then despatch it to you via the Australia Post eParcel service, which includes online tracking. You will receive a shipping notice from us when this occurs.
Share This Book: