000 01391nam a22003614a 4500
001 vtls003160523
003 MY-SjTCS
005 20200226112833.0
006 m u
007 cr cn|||||||||
008 100712s2003 nyu sb 001 0 eng
010 _z 2002-022291
020 _z052166103X
035 _a(CaPaEBR)ebr10069986
039 9 _y201007121336
_zVLOAD
040 _aCaPaEBR
_cCaPaEBR
050 1 4 _aQA175
_b.S47 2003eb
082 0 4 _a512/.2
_221
100 1 _aSeress, Akos,
_d1958-
245 1 0 _aPermutation group algorithms
_h[electronic resource] /
_cÁkos Seress.
260 _aNew York :
_bCambridge University Press,
_c2003.
300 _aix, 264 p. ;
_c23 cm.
490 1 _aCambridge tracts in mathematics ;
_v152
504 _aIncludes bibliographical references (p. 254-261) and index.
529 _aTSLHHL
533 _aElectronic reproduction.
_bPalo Alto, Calif. :
_cebrary,
_d2009.
_nAvailable via World Wide Web.
_nAccess may be limited to ebrary affiliated libraries.
650 0 _aPermutation groups.
650 0 _aAlgorithms.
655 7 _aElectronic books.
_2local
710 2 _aebrary, Inc.
_925628
830 0 _aCambridge tracts in mathematics ;
_v152.
856 4 0 _uhttps://ezproxy.taylors.edu.my/login?url=http://site.ebrary.com/lib/taylorscollege/Doc?id=10069986
_zAn electronic book accessible through the World Wide Web; click to view
999 _c99908