01590nam a2200277 a 4500001001400000003000700014005001700021008004100038020005000079020005000129020005000179020005000229020005000279040000800329100002400337245005500361260005700416300002600473490004900499500030200548500001900850505034500869650002501214650002401239830004901263vtls000016796KUKTEM20251117144227.0061206m20052006njua   f      001 0 eng d  a0321534964 (v.4, fasc. 0 : pbk. : alk. paper)  a0321580508  (v.4, fasc.1 : pbk. : alk. paper)  a0201853930 (v.4, fasc. 2 : pbk. : alk. paper)  a0201853949 (v.4, fasc. 3 : pbk. : alk. paper)  a0321335708 (v.4, fasc. 4 : pbk. : alk. paper)  aUMP1 aKnuth, Donald Ervin14aThe art of computer programming /cDonald E. Knuth  aUpper Saddle River, NJ :bAddison-Wesley,c2005-2009  av.  :bill. ;c25 cm.1 aNewly available sections of the classic work  aIssued in fascicles. Consists of updates being published as the author continues working towards the complete 4th ed. of The art of computer programming, i.e. fascicles are supplements to the 3rd ed. in anticipation of the 4th ed. which will condense the most important material into a single book  aIncludes index1 av. 4, fasc. 0. Introduction to combinatorial algorithms and boolean functions v. 4, fasc. 1. Bitwise tricks & techniques, binary decision diagrams -- v. 4, fasc. 2. Generating all tuples and permutations -- v. 4, fasc. 3. Generating all combinations and partitions -- v. 4, fasc. 4. Generating all trees, history of combinatorial generation 0aComputer programming 0aComputer algorithms 0aNewly available sections of the classic work