Navigating the Cayley graph of SL(2,Z/pZ)
Group Theory
2007-05-23 v1
Abstract
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).
Keywords
Cite
@article{arxiv.math/0301147,
title = {Navigating the Cayley graph of SL(2,Z/pZ)},
author = {Michael Larsen},
journal= {arXiv preprint arXiv:math/0301147},
year = {2007}
}
Comments
6 pages