Orthogonal and Symplectic Black Box Groups, Revisited
Alexandre V. Borovik
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.
Create a lesson
Related papers
Lifts of Brauer characters and vertex pairs for odd primes
Yong Yang
Galois's lost proof on PSL(2,p)
Péter P. Pálfy
Large orbits of p-groups on conjugacy classes
Thomas Michael Keller
Assouad--Nagata dimension of systolic complexes with almost flat intervals
Martín Blufstein, Victor Chepoi, Huaitao Gui et al.
Conjugator length of Bestvina-Brady groups
Jerónimo García-Mejía, Matteo Migliorini
Morse accessibility with applications to Coxeter groups
Matthew Cordes, Annette Karrer, Kim Ruane