Orthogonal and Symplectic Black Box Groups, Revisited
Group Theory
2007-05-23 v1 Probability
Abstract
We propose a simple one sided Monte-Carlo algorithm to distinguish, to any given degree of certainty, between certain symplectic and orthogonal groups over fields of odd order. The algorithm does not use an order oracle and works in polynomial time.
Cite
@article{arxiv.math/0110234,
title = {Orthogonal and Symplectic Black Box Groups, Revisited},
author = {Alexandre V. Borovik},
journal= {arXiv preprint arXiv:math/0110234},
year = {2007}
}
Comments
23 pp, LaTeX2e, requires packages amssymb, amsmath