The Conjugacy Problem in the Grigorchuk Group is polynomial time   decidable
  In this paper we prove that the Conjugacy Problem in the Grigorchuk group $\Gamma$ has polynomial time complexity. 
I. Lysenok, A. Myasnikov, A. Ushakov