000 | 01253cam a2200253 a 4500 | ||
---|---|---|---|
001 | vtls003040896 | ||
003 | MY-SjTCS | ||
005 | 20200306165706.0 | ||
008 | 110218s2006 maua b 001 0 eng | ||
020 | _a0321383281 (pbk. : Int. ed.) | ||
039 | 9 |
_a201208151316 _bizani _c201102181322 _dVLOAD _c200704111559 _dmalathy _c200703191150 _dchon ling _y200612130850 _zjefri |
|
082 | 0 | 0 |
_a511.1 _bDIS |
245 | 0 | 0 |
_aDiscrete mathematics / _cJohn A. Dossey ... [et al.]. |
250 | _a5th ed. | ||
260 |
_aBoston : _bPearson Addison-Wesley, _cc2006. |
||
300 |
_axix, 664 p. : _bill. ; _c24 cm. |
||
504 | _aIncludes bibliographical references (p. 613-617) and index. | ||
505 | _a1. An introduction to combinatorial problems and techniques - 2. Sets, relations, and functions - 3. Coding theory - 4. Graphs - 5. Trees - 6. Matching - 7. Network flows - 8. Counting techniques - 9. Recurrence relations and generating functions - 10. Combinatorial circuits and finite state machines - A. An introduction to logic and proof - B. Matrices - C. The algorithms in this book . | ||
650 | 0 |
_aMathematics. _9271468 |
|
650 | 0 |
_aComputer science _xMathematics. _99172 |
|
700 | 1 |
_aDossey, John A. _913539 |
|
920 | _aGENLS : 181699 | ||
921 | _aSOCIT : 547397 | ||
999 |
_c56889 _d56889 |