The Art of Computer Programming, Volume 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions

Donald E. Knuth

  • 出版商: Addison Wesley
  • 出版日期: 2008-05-01
  • 售價: $1,120
  • 貴賓價: 9.5$1,064
  • 語言: 英文
  • 頁數: 240
  • 裝訂: Paperback
  • ISBN: 0321534964
  • ISBN-13: 9780321534965
  • 相關分類: R 語言Algorithms-data-structures
  • 立即出貨(限量) (庫存=1)

買這商品的人也買了...

商品描述

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 0

This fascicle introduces what will become by far the longest chapter in The Art of Computer Programming, a chapter on combinatorial algorithms that will itself fill three full-sized volumes. Combinatorial algorithms, informally, are techniques for the high-speed manipulation of extremely large quantities of objects, such as permutations or the elements of graphs. Combinatorial patterns or arrangements solve vast numbers of practical problems, and modern approaches to dealing with them often lead to methods that are more than a thousand times faster than the straightforward procedures of yesteryear. This fascicle primes the pump for everything that follows in the chapter, discussing first the essential ideas of combinatorics and then introducing fundamental ideas for dealing efficiently with 0s and 1s inside a machine, including Boolean basics and Boolean function evaluation. As always, the author’s exposition is enhanced by hundreds of new exercises, arranged carefully for self-instruction, together with detailed answers.
 

商品描述(中文翻譯)

這部關於算法分析的多卷作品長期以來一直被認為是經典計算機科學的權威描述。迄今為止已經出版的三卷完整內容在編程理論和實踐方面提供了獨特而寶貴的資源。無數讀者談到了Knuth的著作對他們的深遠影響。科學家對他的分析的美麗和優雅感到驚嘆,而實踐編程人員則成功地將他的“食譜”解決方案應用於日常問題。所有人都欣賞Knuth在他的書中所展現的廣度、清晰度、準確性和幽默感。

為了開始這套書的第四卷和後續卷的編寫,並更新現有的三卷部分內容,Knuth創作了一系列名為“fascicles”的小書,將定期出版。每個fascicle將包含一個或多個全新或修訂的章節。最終,這些fascicles的內容將被整合到每個卷的全面最終版本中,這項從1962年開始的巨大工程將會完成。

第四卷,Fascicle 0

這個fascicle引入了《計算機程序設計藝術》中最長的一章,一個關於組合算法的章節,它本身將填滿三個完整的卷。組合算法,非正式地說,是用於高速操作極大量的對象(如排列或圖的元素)的技術。組合模式或排列解決了大量實際問題,而處理它們的現代方法通常比昔日的直接程序快上千倍。這個fascicle為接下來的章節鋪平了道路,首先討論了組合數學的基本思想,然後介紹了在機器內部高效處理0和1的基本思想,包括布爾基礎知識和布爾函數評估。和往常一樣,作者的解說通過數百個新的練習加以增強,這些練習精心安排供自學,並附有詳細答案。