01233nam a22003254a 4500001001200000003000800012006001900020007001500039008004100054010001700095020001500112040002100127035002000148050002300168082001500191100002800206245007500234260005100309300001500360490004300375504006400418533015200482650002400634650001600658655002900674710001700703830004400720856012600764999001700890ebr10069986CaPaEBRm        u        cr cn|||||||||020213s2003    nyu     sb    001 0 eng    z  2002022291  z052166103X  aCaPaEBRcCaPaEBR  a(OCoLC)7074650614aQA175b.S47 2003eb04a512/.22211 aSeress, �Akos,d1958-10aPermutation group algorithmsh[electronic resource] /c�Akos Seress.  aNew York :bCambridge University Press,c2003.  aix, 264 p.1 aCambridge tracts in mathematics ;v152  aIncludes bibliographical references (p. 254-261) and index.  aElectronic reproduction.bPalo Alto, Calif. :cebrary,d2013.nAvailable via World Wide Web.nAccess may be limited to ebrary affiliated libraries. 0aPermutation groups. 0aAlgorithms. 7aElectronic books.2local2 aebrary, Inc. 0aCambridge tracts in mathematics ;v152.40uhttp://site.ebrary.com/lib/rucke/Doc?id=10069986zAn electronic book accessible through the World Wide Web; click to view  c42629d42629