000			01483cam a22002534a 4500
008			090412s1999 enka b 001 0 eng
010			_a99158766
020			_a0201360616
035			_a(Sirsi) u1395
040			_aEG-CaNU _cEG-CaNU _dEG-CaNU
042			_ancode
082	0	0	_a511.3 _2 21
100	1		_aTruss, J. K. _91480
245	1	0	_aDiscrete mathematics for computer scientists / _c J.K. Truss.
250			_a2nd ed.
260			_aHarlow, England ; _a Reading, Mass. : _b Addison-Wesley, _c 1999.
300			_axix, 585 p. : _b ill. ; _c 24 cm.
504			_aIncludes bibliographical references and index.
505	0		_a * Preface * List of Symbols * The Natural Numbers * Introductory Logic * Sets, Relations and Functions * Algebraic Topics * Combinatorics * Partially Ordered Structures * Further Logic * Graphs * Formal Machines * Analysis of Algorithms and Complexity Theory * Coding Theory * Answers to selected exercises * Bibliography * Index
520			_aThis is a new and updated edition of John Truss' successful introduction to discrete mathematics for computer scientists. The book adopts a rigorous approach to mathematical concepts, and contains over 700 practical exercises
520	3		_aThis popular introduction to discrete mathematics for computer scientists combines a rigorous approach to mathematical concepts with strong motivation of these techniques via practical examples.
650		0	_aComputer science _x Mathematics. _91481
596			_a1
999			_c439 _d439