The art of computer programming, Volume 4, Fascicle 0: introduction to combinatorial algorithms and Boolean functions

摘要

Those not familiar with this body of work might be puzzled with the way this fascicle fits into the big picture. Knuth has made every effort to make this volume self-contained, making as few references as possible to the rest of the volumes. However, the reader must be warned that there are references to chapters and sections that are yet to exist, for example, 7.2.3, addressing how to decompose a problem into combinatorially inequivalent classes of arrangements.