000 | 01162nam a22001937a 4500 | ||
---|---|---|---|
008 | 240606b |||||||| |||| 00| 0 eng d | ||
020 | _a9780201038064 | ||
082 |
_a005.1 _bKNU |
||
100 |
_aKnuth, Donald Ervin _911069 |
||
245 | _aArt of computer programming: combinatorial algorithms, volume 4B- part 2 | ||
260 |
_aBoston _bAddison-Wesley _c2023 |
||
300 |
_axvii, 714p. _bhb. |
||
500 | _ahttps://www.pearson.com/en-us/subject-catalog/p/art-of-computer-programming-volume-4b-the-combinatorial-algorithms/P200000002106/9780201038064 | ||
520 | _aPreface v Notes on the Exercises xi Mathematical Preliminaries Redux 1 Chapter 7: Combinatorial Searching 7.2.2 Backtrack Programming 30 7.2.2.1 Dancing links 65 7.2.2.2 Satisfiability 185 Answers to Exercises 370 Appendix A: Tables of Numerical Quantities 656 Appendix B: Index to Notations 660 Appendix C: Index to Algorithms and Theorems 666 Appendix D: Index to Combinatorial Problems 667 Appendix E: Answers to Puzzles in the Answers 671 Index and Glossary 674 | ||
650 | _aComputer science | ||
650 | _aComputer Programming | ||
650 | _aComputer Algorithms | ||
942 | _cBK | ||
999 |
_c10253 _d10253 |