| 000 | 01787nam a22002775i 4500 | ||
|---|---|---|---|
| 999 |
_c41980 _d41980 |
||
| 001 | 37347 | ||
| 003 | BD-DhAAL | ||
| 005 | 20211111150827.0 | ||
| 008 | 212701t20202019maua 001 0 eng | ||
| 010 | _a 2019946479 | ||
| 020 | _a9780134671796 | ||
| 020 | _a9780134671791 | ||
| 040 |
_aDLC _beng _erda _cDLC _dBD-DhAAL |
||
| 042 | _apcc | ||
| 082 |
_a005.1 _223 |
||
| 100 | 1 |
_aKnuth, Donald E. _940805 |
|
| 245 | 1 | 4 |
_aThe art of computer programming, _nvolume 4, fascicle 5 : _bmathematical preliminaries redux; introduction to backtracking; dancing links / _cDonald E. Knuth. |
| 260 |
_aBoston : _bAddison-Wesley, _cc2020 |
||
| 300 |
_aviii, 382 pages : _billustrations ; _c22 cm. |
||
| 500 | _aIncludes index. | ||
| 520 | _a"This fascicle covers three separate topics: 1. Mathematical Preliminaries. Knuth writes that this portion of fascicle 5 "extends the 'Mathematical Preliminaries' of Section 1.2 in Volume 1 to things that I didn't know about in the 1960s. Most of this new material deals with probabilities and expectations of random events; there's also an introduction to the theory of martingales." 2. Backtracking: this section is the counterpart to section 7.2.1 which covered the generation of basic combinatorial patterns. This section covers non-basic patterns, ones where the developer needs to make tentative choices and then may need to backtrack when those choices need revision. 3. Dancing Links: this section is related to 2 above. It develops an important data structure technique that is suitable for backtrack programming described above"-- | ||
| 526 | _aCSE | ||
| 650 |
_aComputer programming. _940806 |
||
| 650 |
_aComputer algorithms. _940807 |
||
| 650 |
_aComputer science _942581 |
||
| 852 |
_aAyesha Abed Library _cGeneral Stacks |
||
| 942 |
_2ddc _cBK |
||