Constructive recognition of classical groups in odd characteristic

Show simple item record Leedham-Green, CR en O'Brien, Eamonn en 2012-03-21T19:39:36Z en 2009-08-01 en
dc.identifier.citation Journal of Algebra 322(3):833-881 2009 en
dc.identifier.issn 0021-8693 en
dc.identifier.uri en
dc.description.abstract Let G = (X) <= GL(d, F) be a classical group in its natural representation defined over a finite field F of odd characteristic. We present Las Vegas algorithms to construct standard generators for G which permit its to write an element of G as a straight-line program in X. The algorithms run in polynomial-time, subject to the existence of a discrete logarithm oracle for F. (C) 2009 Elsevier Inc. All rights reserved. en
dc.language EN en
dc.publisher Elsevier and Acadamic Press en
dc.relation.ispartofseries Journal of Algebra en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. Details obtained from en
dc.rights.uri en
dc.subject Classical groups en
dc.subject Constructive recognition en
dc.subject FINITE-FIELDS en
dc.subject ALGORITHM en
dc.title Constructive recognition of classical groups in odd characteristic en
dc.type Journal Article en
dc.identifier.doi 10.1016/j.jalgebra.2009.04.028 en
pubs.issue 3 en
pubs.begin-page 833 en
pubs.volume 322 en
dc.rights.holder Copyright: Elsevier and Acadamic Press en
pubs.end-page 881 en
pubs.publication-status Published en
dc.rights.accessrights en
pubs.subtype Article en
pubs.elements-id 89782 en Science en Mathematics en
pubs.record-created-at-source-date 2010-09-01 en

Files in this item

There are no files associated with this item.

Find Full text

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace