计算机与难解性

Hacker News 上怎么说

• TheTarquin · 2008 年

  我干脆直说了，我要给两部封神之作投上一票：Garey 和 Johnson 写的《计算机与难解性》（Computers and Intractability），以及高德纳（Donald Knuth）的《计算机程序设计艺术》（The Art of Computer Programming）。第一本即使偶尔有点艰深，也是一本绝佳的计算理论速成教材……

  I'm gonna come right out and throw a vote in for two of the canonical works: <i>Computers and Intractability</i> by Garey and Johnson and Donald Knuth's <i>The Art of Computer Programming</i>. The first one is a great, if occasionally thick, crash course in Theory of Computation and…

• nextos · 2019 年

  一本相关的参考书，这本书里也引用了，篇幅更短、也更简单一些，那就是 Garey 和 Johnson 的《计算机与难解性》。它真是一本非常优秀的经典小教材。

  A related reference, cited by this book, and a bit shorter and simpler is Garey & Johnson Computers and Intractability. It's a really good classic little textbook.

• dloranc · 2024 年

  我手头有且推荐的书：Introduction to the theory of computation - Michael Sipser Computational complexity - Arora, Barak Computational Complexity - Christos H. Papadimitriou Computers and intractability - Michael R. Garey, David S. Johnson

  Books I have and recommend: Introduction to the theory of computation - Michael Sipser Computational complexity - Arora, Barak Computational Complexity - Christos H. Papadimitriou Computers and intractability - Michael R. Garey, David S. Johnson

• abetusk · 2019 年

  ……理解之道。香农关于信息论的论文算是一个例外。排名不分先后，以下是我觉得极其出色的一些书（非常符合我个人的口味）：[0] Garey 和 Johnsen 写的《计算机与难解性：NP完全性理论指南》（Computers and Intractability: A Guide to the Theory of NP-Completeness） [1] Strichartz 写的《分析之道》（The Way of Analysis） [2] Cormen、Leiserson、Rivest 和 Stein 写的《算法导论》（Introduction to Algorithms） [3] 《Fundamental Problems of…

  …the way of understanding. One exception is Shannon's paper on information theory. In no particular order, here are a list of books I've found exceptional (very much catered to my personal taste): [0] Computers and Intractability: A Guide to the Theory of NP-Completeness by Garey and Johnsen [1] The Way of Analysis by Strichartz [2] Introduction to Algorithms by Cormen, Leiserson, Rivest and Stein [3] Fundamental Problems of…

• nextos · 2015 年

  ……作为 SICP 的前传，我超爱《The Little Schemer》。我也很喜欢《The Art of Prolog》。作为 Prolog 的现代继承者，https://probmods.org/ 简直棒极了。要是聊理论计算机科学（theoretical CS），http://en.wikipedia.org/wiki/Computers_and_Intractability 相当给力。非常简短精炼，优雅至极。

  …prequel to SICP, I love The Little Schemer. I love The Art of Prolog too. As a modern successor to Prolog, https://probmods.org/ is awesome. If we talk about theoretical CS, http://en.wikipedia.org/wiki/Computers_and_Intractability is terrific. Very short and elegant.

• ehudla · 2016 年

  又一位 CS 界的英雄离世了。《计算机与难解性》是我最早买的 CS 书籍之一。书一开头讲的那个段子，说你去找老板交代时承认“我找不到高效的算法，大概是我太笨了”（而不是去证明……

  Again, the passing of one of CS heroes. /Computers and Intractability/ was one of the first CS books I bought. The anecdote they open with, about coming to your boss claiming "I can't find an efficient algorithm, I guess I'm just too dumb" (as opposed to proving that the…

正在加载完整评论……