Abstract
We present a probabilistic polynomial-time algorithm to find a path of length O(logp log logp) between any two vertices of the Cayley graph of SL2(Fp) with respect to the generators (1101) and (1011).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.