pith. sign in

arxiv: math/0110234 · v1 · submitted 2001-10-21 · 🧮 math.GR · math.PR

Orthogonal and Symplectic Black Box Groups, Revisited

classification 🧮 math.GR math.PR
keywords algorithmgroupsorderorthogonalsymplecticblackcertaincertainty
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.