MARC details
| 000 -LEADER |
|---|
| fixed length control field |
02426nam a22002537a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
IIITD |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20250807180739.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
250729b |||||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780201038040 |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
IIITD |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
005.1 |
| Item number |
KNU-A |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Knuth, Donald E. |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
The art of computer programming : |
| Remainder of title |
combinatorial algorithms vol IVA, part 1 |
| Statement of responsibility, etc |
by Donald E. Knuth |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication, distribution, etc |
New York : |
| Name of publisher, distributor, etc |
Addison-Wesley, |
| Date of publication, distribution, etc |
©2011 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xv, 883 p. : |
| Other physical details |
ill. ; |
| Dimensions |
25 cm. |
| 500 ## - GENERAL NOTE |
|---|
| General note |
Inclues index. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Title |
Chapter 7. Combinatorial searching |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
The 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 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer programming |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer algorithms |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Fundamental algorithms |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Seminumerical algorithms |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Dewey Decimal Classification |
| Koha item type |
Books |
