000 | 00676 a2200205 4500 | ||
---|---|---|---|
020 | _a9788131501214 | ||
082 | _a510 HAG/Dis | ||
100 | _aHaggard, Gary | ||
245 |
_aDiscrete mathematics for computer science _cGary Haggard, John Schlipf and Sue Whitesides |
||
260 |
_aNew Delhi _bCengage Learning India Pvt. Ltd. _c2008 |
||
300 |
_axxiii;600 p. _bPaperback _c24 cm. |
||
500 | _aIncludes appendix and index. | ||
650 | _aSets, proof templets, and induction | ||
650 | _aGraph theory | ||
650 | _aAnalysis of algorithms | ||
650 | _aBinary relations- equivalence relations | ||
650 | _aFormal Logic | ||
700 | _aSchlipf, John | ||
700 | _aWhitesides, Sue | ||
999 |
_c108661 _d108661 |