Constructive membership in black-box groups

Petra Elisabeth Holmes, Stephen Alexander Linton, E. A. O'Brien, A. J. E. Ryba, R. A. Wilson

Research output: Contribution to journalArticlepeer-review

16 Citations (Scopus)

Abstract

We present an algorithm to reduce the constructive membership problem for a black-box group G to three instances of the same problem for involution centralizers in G. If G is a finite simple group of Lie type in odd characteristic, then this reduction can be performed in (Monte Carlo) polynomial time.

Original languageEnglish
Pages (from-to)747-763
Number of pages17
JournalJournal of Group Theory
Volume11
Issue number6
Early online date30 Sept 2008
DOIs
Publication statusPublished - Nov 2008

Keywords

  • LIE TYPE
  • RECOGNITION
  • PROBABILITY
  • ALGORITHM
  • ELEMENT

Fingerprint

Dive into the research topics of 'Constructive membership in black-box groups'. Together they form a unique fingerprint.

Cite this