01247nam a22003254a 4500001001200000003000800012005001700020006001900037007001500056008004100071010001700112020001500129040002100144035002100165050002300186082001500209100002700224245007400251260005100325300002500376490004300401504006400444533015200508650002400660650001600684655002900700710001700729830004400746856013100790ebr10069986CaPaEBR20260707175015.0m        u        cr cn|||||||||020213s2003    nyu     sb    001 0 eng    z  2002022291  z052166103X  aCaPaEBRcCaPaEBR  a(OCoLC)64672468114aQA175b.S47 2003eb04a512/.22211 aSeress, Ákos,d1958-10aPermutation group algorithmsh[electronic resource] /cÁkos Seress.  aNew York :bCambridge University Press,c2003.  aix, 264 p. ;c23 cm.1 aCambridge tracts in mathematics ;v152  aIncludes bibliographical references (p. 254-261) and index.  aElectronic reproduction.bPalo Alto, Calif. :cebrary,d2009.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/strathmore/Doc?id=10069986zAn electronic book accessible through the World Wide Web; click to view