Free Delivery Over $100
|
|
|||
|
||||
OverviewIf a black box simple group is known to be isomorphic to a classical group over a field of known characteristic, a Las Vegas algorithm is used to produce an explicit isomorphism. The proof relies on the geometry of the classical groups rather than on difficult group-theoretic background. This algorithm has applications to matrix group questions and to nearly linear time algorithms for permutation groups. In particular, we upgrade all known nearly linear time Monte Carlo permutation group algorithms to nearly linear Las Vegas algorithms when the input group has no composition factor isomorphic to an exceptional group of Lie type or a 3-dimensional unitary group. Full Product DetailsAuthor: W.M. Kantor , Akos SeressPublisher: American Mathematical Society Imprint: American Mathematical Society Volume: No. 708 Weight: 0.333kg ISBN: 9780821826195ISBN 10: 0821826190 Pages: 168 Publication Date: 30 January 2001 Audience: College/higher education , Professional and scholarly , Undergraduate , Postgraduate, Research & Scholarly Format: Paperback Publisher's Status: Active Availability: Out of stock  The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |
||||
