图书目录大全

Computers and Intractability 在线电子书 pdf 下载 txt下载 epub 下载 mobi 下载 2024

☆☆☆☆☆
简体网页||繁体网页

M R Garey 作者

W. H. Freeman

译者

1979-4-26 出版日期

338 页数

GBP 53.99 价格

Paperback

丛书系列

9780716710455 图书编码

Computers and Intractability 在线电子书图书标签: 计算机科学计算复杂性计算机数学 NP CS 算法 TCS

喜欢 Computers and Intractability 在线电子书的读者还喜欢

下载链接在页面底部

点击这里下载

想要找书就要到图书目录大全

book.wenda123.org

立刻按 ctrl+D收藏本页

你会得到大惊喜!!

发表于2024-06-18

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 复制链接

Computers and Intractability 在线电子书 epub 下载 mobi 下载 pdf 下载 txt 下载 2024

Computers and Intractability 在线电子书 pdf 下载 txt下载 epub 下载 mobi 下载 2024

Computers and Intractability 在线电子书用户评价

评分☆☆☆☆☆

就NP-hard的归约而言，这本书实在是太棒了，证明都很elegant。我印象最深的是关于3SAT NP-hard的proof，比Boaz和Sanjeev那本讲得好了太多，当然，Boaz那本比较适合真正要做research的人，这本对要做research人来说没什么用，都是很早之前的研究成果了。

评分☆☆☆☆☆

NP不会证明就看看这本吧。但是假如应付考试Algorithm Design那本就足够了。

评分☆☆☆☆☆

我没读完过，读过前几章，能证明一些NP，但是还是搞不清楚SAT是怎么证的

评分☆☆☆☆☆

坑

评分☆☆☆☆☆

The ultimate guide to NP-completeness

Computers and Intractability 在线电子书著者简介

Computers and Intractability 在线电子书图书目录

Computers and Intractability 在线电子书 pdf 下载 txt下载 epub 下载 mobi 在线电子书下载

Computers and Intractability 在线电子书图书描述

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.

Computers and Intractability 在线电子书下载 mobi epub pdf txt 在线电子书下载

想要找书就要到图书目录大全

book.wenda123.org

立刻按 ctrl+D收藏本页

你会得到大惊喜!!