34 citations · 102 across the 27 of their papers we have counts for
1 paper · 2 filters
Michael Larsen
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).