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

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

6 pages

Scientific paper

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).

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Navigating the Cayley graph of SL(2,Z/pZ) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Navigating the Cayley graph of SL(2,Z/pZ), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Navigating the Cayley graph of SL(2,Z/pZ) will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-220349

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.