| 000 | 00902nam a2200193Ia 4500 | ||
|---|---|---|---|
| 008 | 140223b2004 xxu||||| |||| 00| 0 eng d | ||
| 020 |
_a9781568811666 _c0.00 |
||
| 082 | _bMAU | ||
| 100 | _aMaurer, Stephen B. | ||
| 245 | _aDiscrete Algorithmic Mathematics | ||
| 250 | _a3rd ed | ||
| 260 |
_aWellesley _bA. K. Peters Ltd. _c2004 |
||
| 300 | _a772p | ||
| 500 | _aMathematical Preliminaries Algorithms Mathematical Induction Graphs and Trees Fundamental Counting Methods Difference Equations Probability Introduction to Mathematical Logic Epilogue: Coming Full Circle with Biology and Minimax Theorems | ||
| 600 | _aMathematics | ||
| 700 | _aRalston, Anthony | ||
| 890 | _aUSA | ||
| 995 |
_AMAU _B004615 _CENT-NIT _D1690.12 _E0 _F049 _G2112 _H0 _I0.00 _J2112.65 20% _L20060428 _M02 _UA _W20060513 _XMahajan Book Depot _ZReference |
||
| 999 |
_c45380 _d45380 |
||