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 language | English |
|---|---|
| Pages (from-to) | 747-763 |
| Number of pages | 17 |
| Journal | Journal of Group Theory |
| Volume | 11 |
| Issue number | 6 |
| Early online date | 30 Sept 2008 |
| DOIs | |
| Publication status | Published - 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.Projects
- 1 Finished
-
EP/C523229/1: Multidisciplinary Critical Mass in Computational Algebra and Applications
Linton, S. (PI), Gent, I. (CoI), Leonhardt, U. (CoI), Mackenzie, A. (CoI), Miguel, I. (CoI), Quick, M. (CoI) & Ruskuc, N. (CoI)
1/09/05 → 31/08/10
Project: Standard
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver