The Conjugacy Problem in the Grigorchuk Group is polynomial time decidable

Details The Conjugacy Problem in the Grigorchuk Group is polynomial time decidable The Conjugacy Problem in the Grigorchuk Group is polynomial time decidable

2008-08-18

arxiv.org/abs/0808.2502v1

Mathematics

Group Theory

17 pages

Scientific paper

In this paper we prove that the Conjugacy Problem in the Grigorchuk group
$\Gamma$ has polynomial time complexity.

Affiliated with

Also associated with

No associations

Rating

The Conjugacy Problem in the Grigorchuk Group is polynomial time decidable 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 The Conjugacy Problem in the Grigorchuk Group is polynomial time decidable, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Conjugacy Problem in the Grigorchuk Group is polynomial time decidable will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-131695