The Art of Computer Programming, Volume 4, Fascicle 4 : Generating All Trees--History of Combinatorial Generation (Paperback)
Donald E. Knuth
- 出版商: Addison Wesley
- 出版日期: 2006-02-01
- 售價: $1,180
- 貴賓價: 9.5 折 $1,121
- 語言: 英文
- 頁數: 128
- 裝訂: Paperback
- ISBN: 0321335708
- ISBN-13: 9780321335708
-
相關分類:
R 語言
立即出貨(限量) (庫存=1)
買這商品的人也買了...
-
$2,980$2,831 -
$2,980$2,831 -
$3,040$2,888 -
$1,225Discrete and Combinatorial Mathematics: An Applied Introduction, 5/e (IE-Paperback)
-
$650$553 -
$490$382 -
$1,260$1,197 -
$1,150$1,093 -
$350$277 -
$1,150$1,093 -
$390$332 -
$650$507 -
$450$356 -
$450$351 -
$720$569 -
$580$493 -
$1,127Digital Signal Processing : Principles, Algorithms and Applications, 4/e (IE-Paperback)
-
$520$411 -
$3,600$3,528 -
$1,120$1,064 -
$1,020$969 -
$1,406$1,332 -
$1,330$1,264 -
$1,500$1,425 -
$2,146Introduction to Algorithms, 4/e (Hardcover)
相關主題
商品描述
Description:
This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science.The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth's writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his “cookbook” solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.
To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called fascicles, which will be published at regular intervals. Each fascicle will encompass a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete.
Volume 4, Fascicle 4
This latest fascicle covers the generation of all trees, a basic topic that has surprisingly rich ties to the first three volumes of The Art of Computer Programming. In thoroughly discussing this well-known subject, while providing 124 new exercises, Knuth continues to build a firm foundation for programming. To that same end, this fascicle also covers the history of combinatorial generation. Spanning many centuries, across many parts of the world, Knuth tells a fascinating story of interest and relevance to every artful programmer, much of it never before told. The story even includes a touch of suspense: two problems that no one has yet been able to solve.
商品描述(中文翻譯)
「描述:」這部關於算法分析的多卷作品長期以來一直被公認為經典計算機科學的權威描述。迄今為止已經出版的三卷完整內容在編程理論和實踐方面提供了獨特而寶貴的資源。無數讀者談到了Knuth著作對他們的深遠影響。科學家們對他的分析的美麗和優雅感到驚嘆,而實踐編程人員則成功地將他的「食譜」解決方案應用於日常問題。所有人都欣賞Knuth在他的書中所展現的廣度、清晰度、準確性和幽默感。
為了開始這套書的第四卷和後續卷的編寫,並更新現有的三卷的部分內容,Knuth創作了一系列名為「fascicles」的小書,將定期出版。每個「fascicle」將包含一個或多個全新或修訂的章節。最終,這些「fascicles」的內容將被整合到每個卷的全面最終版本中,這項從1962年開始的巨大工程將會完成。
「第四卷,Fascicle 4」這本最新的「fascicle」涵蓋了所有樹的生成,這是一個與《計算機程序設計藝術》前三卷意外地有著豐富聯繫的基礎主題。Knuth在詳細討論這個眾所周知的主題的同時,提供了124個新的練習題,繼續為編程建立堅實的基礎。為了達到同樣的目的,這本「fascicle」還涵蓋了組合生成的歷史。跨越多個世紀,涉及世界各地的許多部分,Knuth講述了一個對每個有藝術性的程序員都感興趣且相關的迷人故事,其中很多故事以前從未被講述過。這個故事甚至包含了一點懸疑:兩個至今無人能夠解決的問題。