000 | 00875nam a2200241 a 4500 | ||
---|---|---|---|
001 | vtls003141445 | ||
003 | MY-SjTCS | ||
005 | 20200207084222.0 | ||
008 | 110218s2008 nyua 001 0 eng d | ||
020 | _a0521849314 (hbk.) | ||
020 | _a9780521849319 (hbk.) | ||
039 | 9 |
_a201102181412 _bVLOAD _c201008251338 _dkomathi _c200909241430 _dsiew_eng _c200909081214 _dkevin _y200904241656 _zmalathy |
|
082 | 0 | 4 |
_a518.1 _bEDM |
100 | 1 |
_aEdmonds, Jeff, _d1963- |
|
245 | 1 | 0 |
_aHow to think about algorithms / _cJeff Edmonds. |
260 |
_aCambridge ; _aNew York : _bCambridge University Press, _c2008. |
||
300 |
_axiii, 448 p. : _bill. ; _c25 cm. |
||
500 | _aIncludes index. | ||
650 | 0 |
_aAlgorithms _xStudy and teaching. |
|
650 | 0 |
_aLoops (Group theory) _xStudy and teaching. |
|
650 | 0 |
_aInvariants _xStudy and teaching. |
|
650 | 0 |
_aRecursion theory _xStudy and teaching. |
|
999 |
_c103975 _d103975 |