2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/66256This 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 pagesGroup Theory05C25 (Primary) 20F65, 68Q25, 68R10 (Secondary)text