000			02426nam a22002537a 4500
003			IIITD
005			20250807180739.0
008			250729b |||||||| |||| 00| 0 eng d
020			_a9780201038040
040			_aIIITD
082			_a005.1 _bKNU-A
100			_aKnuth, Donald E.
245			_aThe art of computer programming : _bcombinatorial algorithms vol IVA, part 1 _cby Donald E. Knuth
260			_aNew York : _bAddison-Wesley, _c©2011
300			_axv, 883 p. : _bill. ; _c25 cm.
500			_aInclues index.
505			_tChapter 7. Combinatorial searching
520			_aThe Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1 Knuth’s multivolume analysis of algorithms is widely recognized as the definitive description of classical computer science. The first three volumes of this work have long comprised a unique and invaluable resource in programming theory and practice. Scientists have marveled at the beauty and elegance of Knuth’s analysis, while practicing programmers have successfully applied his “cookbook” solutions to their day-to-day problems. The level of these first three volumes has remained so high, and they have displayed so wide and deep a familiarity with the art of computer programming, that a sufficient “review” of future volumes could almost be: “Knuth, Volume n has been published.” – Data Processing Digest Knuth, Volume n has been published, where n = 4A. In this long-awaited new volume, the old master turns his attention to some of his favorite topics in broadword computation and combinatorial generation (exhaustively listing fundamental combinatorial objects, such as permutations, partitions, and trees), as well as his more recent interests, such as binary decision diagrams. The hallmark qualities that distinguish his previous volumes are manifest here anew: detailed coverage of the basics, illustrated with well-chosen examples; occasional forays into more esoteric topics and problems at the frontiers of research; impeccable writing peppered with occasional bits of humor; extensive collections of exercises, all with solutions or helpful hints; a careful attention to history; implementations of many of the algorithms in his classic step-by-step form.
650			_aComputer programming
650			_aComputer algorithms
650			_aFundamental algorithms
650			_aSeminumerical algorithms
942			_2ddc _cBK
999			_c209241 _d209241