วันเสาร์ที่ 22 ตุลาคม พ.ศ. 2554

Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)

Review for Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)

Knowing God: Walking through the Book of Books
Are looking for Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
Item Average Rating : free unlimited image hosting
Item List Price :
You Save Price :  
Item Offer Price : Check Price Now!!  

We offer this product at a low cost, quality and service from Amazon.com Free Shipping on $ 25 purchase every day.


We offer a book Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) This book gives you a special price. Offers free shipping on purchases over $ 25 at Amazon.com now before stock runs out.


Review for Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)

Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) Review


This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, "I can't find an efficient algorithm, but neither can all these famous people." This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.

The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; Computers and Intractability does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) Computers and Intractability also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references. Readmore .. .



We recommend that you check the price of the book Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences), with this product is out at Amazon.com.!!Check Price Now!!




Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)

Video Door Phone Intercom System - Wireless Video Doorbell - Telephone System SIP PBX - Video Literature and Fiction Books - Children's Literature - Genre Fiction - Contemporary - Drama

ไม่มีความคิดเห็น:

แสดงความคิดเห็น