Newsletter   Secure Checkout   Shopping Cart (0 Items)  
Search:    Welcome Guest! Save up to 30-40% on most items with our awesome everyday discounts!

Algorithmics for Hard Problems [Hardcover]

Our Price $ 93.06  
Retail Value $ 99.00  
You Save $ 5.94  
Item Number 229512  
Buy New $93.06
Available on the Internet only.

Item description for Algorithmics for Hard Problems by Juraj Hromkovic...

There are several approaches to attack hard problems. All have their merits, but also their limitations, and need a large body of theory as their basis. A number of books for each one exist: books on complexity theory, others on approximation algorithms, heuristic approaches, parametrized complexity, and yet others on randomized algorithms. This book discusses thoroughly all of the above approaches. And, amazingly, at the same time, does this in a style that makes the book accessible not only to theoreticians, but also to the non-specialist, to the student or teacher, and to the programmer. Do you think that mathematical rigor and accessibility contradict? Look at this book to find out that they do not, due to the admirable talent of the author to present his material in a clear and concise way, with the idea behind the approach spelled out explicitly, often with a revealing example.
Reading this book is a beautiful experience and I can highly recommend it to anyone interested in learning how to solve hard problems. It is not just a condensed union of material from other books. Because it discusses the different approaches in depth, it has the chance to compare them in detail, and, most importantly, to highlight under what circumstances which approach might be worth exploring. No book on a single type of solution can do that, but this book does it in an absolutely fascinating way that can serve as a pattern for theory textbooks with a high level of generality. (Peter Widmayer)
The second edition extends the part on the method of relaxation to linear programming with an emphasis on rounding, LP-duality, and primal-dual schema, and provides a self-contained and transparent presentation of the design of randomized algorithms for primality testing.

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!

Item Specifications...

Pages   557
Est. Packaging Dimensions:   Length: 9.29" Width: 6.22" Height: 1.34"
Weight:   2.03 lbs.
Binding  Hardcover
Release Date   Nov 19, 2002
Publisher   Springer
ISBN  3540441344  
ISBN13  9783540441342  

Availability  147 units.
Availability accurate as of Oct 24, 2016 04:53.
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.

More About Juraj Hromkovic

Register your artisan biography and upload your photo! Juraj Hromkovic was born in 1958.

Are You The Artisan or Author behind this product?
Improve our customers experience by registering for an Artisan Biography Center Homepage.

Product Categories

1Books > Special Features > New & Used Textbooks > Computer Science & Information Systems > Networking
2Books > Special Features > New & Used Textbooks > Sciences > Mathematics
3Books > Subjects > Computers & Internet > Computer Science > Artificial Intelligence > Heuristic & Constrained Search
4Books > Subjects > Computers & Internet > Computer Science > Artificial Intelligence > Theory of Computing
5Books > Subjects > Computers & Internet > General
6Books > Subjects > Computers & Internet > Hardware > System Architecture > Parallel Computing
7Books > Subjects > Computers & Internet > Networking > Networks, Protocols & API's > General
8Books > Subjects > Computers & Internet > Programming > Algorithms > General
9Books > Subjects > Professional & Technical > Professional Science > Mathematics > Pure Mathematics > Logic
10Books > Subjects > Science > Mathematics > Pure Mathematics > Logic

Reviews - What do customers think about Algorithmics for Hard Problems?

Good Book for Advanced Computing  Feb 12, 2003
Algorithmics for Hard Problems addresses an important (if somewhat small) group of technical people who work exclusively on intractable problems. It takes a great deal of creativity and a large set of intellectual tools to make even modest progress on these problems. Prof. Hromkovic's book presents and organizes a big package of ideas and tools for approaching these problems. Even the last section, entitled "A Guide to Solving Hard Problems" addresses some of the practical issues of working on problems for which a completely satisfactory answer may be out of reach.

This book is especially helpful for software professionals solving difficult problems because it helps one to categorize and understand where the "pain points" can be found. In many software applications very hard problems are hidden within perfectly reasonable appearing and seemingly benign systems -- it's critical in these cases to correctly project the details of the problem onto a well defined set of basis tasks.


Write your own review about Algorithmics for Hard Problems

Ask A Question or Provide Feedback regarding Algorithmics for Hard Problems

Item Feedback and Product Questions
For immediate assistance call 888.395.0572 during the hours of 10am thru 8pm EST Monday thru Friday and a customer care representative will be happy to help you!

Help us continuously improve our service by reporting your feedback or questions below:

I have a question regarding this product
The information above is incorrect or conflicting
The page has misspellings or incorrect grammar
The page did not load correctly in my browser or created an error.

Email Address:
Anti Spam Question. To combat spammers we require that you answer a simple question.
What color is the sky?
Leave This Blank :
Do Not Change This Text :

Add This Product Widget To Your Website

Looking to add this information to your own website? Then use our Product Widget to allow you to display product information in a frame that is 120 pixels wide by 240 pixels high.

    Copy and paste the following HTML into your website and enjoy!

Order toll-free weekdays 10am thru 10pm EST by phone: 1-888-395-0572 (Lines are closed on holidays & weekends.)
Customer Service | My Account | Track My Orders | Return Policy | Request Free Catalog | Email Newsletter

Gift Certificates
RSS Feeds
About Us
Contact Us
Terms Of Use
Privacy Policy