Orthogonal and Symplectic Black Box Groups, Revisited

Simple item page
dc.creatorBorovik, Alexandre V.
dc.date2001-10-21
dc.date.accessioned2026-07-07T04:43:59Z
dc.date.available2026-07-07T04:43:59Z
dc.descriptionWe 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.
dc.description23 pp, LaTeX2e, requires packages amssymb, amsmath
dc.identifierhttps://arxiv.org/abs/math/0110234
dc.identifierhttp://arxiv.org/abs/math/0110234
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/62459
dc.subjectGroup Theory
dc.subjectProbability
dc.subject20P05
dc.titleOrthogonal and Symplectic Black Box Groups, Revisited
dc.typetext

Files

Collections

arXiv