Navigating the Cayley graph of SL(2,Z/pZ)

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

This paper describes a non-deterministic polynomial-time algorithm to find a path of length O(log p loglog p) between any two vertices of the Cayley graph of SL(2,Z/pZ).
6 pages

Keywords

Group Theory, 05C25 (Primary) 20F65, 68Q25, 68R10 (Secondary)

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/66256

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0301147
 http://arxiv.org/abs/math/0301147

Collections

arXiv