- ペーパーバック: 320ページ
- 出版社: Addison-Wesley Professional; 1版 (2015/12/18)
- 言語: 英語
- ISBN-10: 0134397606
- ISBN-13: 978-0134397603
- 発売日： 2015/12/18
- 商品の寸法: 16.3 x 2.7 x 24 cm
- カスタマーレビュー: 評価の数 16
- Amazon 売れ筋ランキング: 洋書 - 95,610位 (洋書の売れ筋ランキングを見る)
The Art of Computer Programming, Volume 4, Fascicle 6: Satisfiability (英語) ペーパーバック – 2015/12/18
Kindle 端末は必要ありません。無料 Kindle アプリのいずれかをダウンロードすると、スマートフォン、タブレットPCで Kindle 本をお読みいただけます。
Donald E. Knuth is known throughout the world for his pioneering work on algorithms and programming techniques, for his invention of the TEX and METAFONT systems for computer typesetting, and for his prolific and influential writing. Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the completion of these fascicles and the seven volumes to which they belong.
More, though, the sections at the beginning showing what a SAT solver can be used for are particularly eye opening. In many ways, it paints SAT as a brute force hammer for solving problems. It is an interesting form of brute force that is widely applicable and can still be used, however. I'm looking forward to giving myself time to work on the LIFE transitions problem. (I may cheat and use Knuth's version of SAT solvers posted on his website.)
After that, it is interesting to see the empiricism that goes into analyzing the various algorithms developed. Most that have not read him believe Knuth to be focused on the theoretical limits of algorithms. One need only look at the chart on timings to see that this is not true.
As in previous books, I confess most of the exercises are above my ability. Luckily, you are encouraged to read the answers and should not be put off by the challenge of the problems. Instead, it is the challenges that makes things fun.