000 01903nam a2200325 a 4500
001 vtls000016796
003 KUKTEM
005 20251117144227.0
008 061206m20052006njua f 001 0 eng d
020 _a0321534964 (v.4, fasc. 0 : pbk. : alk. paper)
020 _a0321580508 (v.4, fasc.1 : pbk. : alk. paper)
020 _a0201853930 (v.4, fasc. 2 : pbk. : alk. paper)
020 _a0201853949 (v.4, fasc. 3 : pbk. : alk. paper)
020 _a0321335708 (v.4, fasc. 4 : pbk. : alk. paper)
039 9 _a201205030952
_bida
_c201205030902
_dida
_c201107132125
_dVLOAD
_c201008121024
_dfauzi
_y200612061008
_zdilla
040 _aUMP
090 _aQA76.6 .K588 2005
100 1 _aKnuth, Donald Ervin
245 1 4 _aThe art of computer programming /
_cDonald E. Knuth
260 _aUpper Saddle River, NJ :
_bAddison-Wesley,
_c2005-2009
300 _av. :
_bill. ;
_c25 cm.
490 1 _aNewly available sections of the classic work
500 _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
500 _aIncludes index
505 1 _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
650 0 _aComputer programming
650 0 _aComputer algorithms
830 0 _aNewly available sections of the classic work
999 _aVIRTUA40
_c31963
_d31969
999 _aVTLSSORT0080*0200*0201*0202*0203*0204*0400*0900*1000*2450*2600*3000*4900*5000*5001*5050*6500*6501*8300*9991