Author:
Miasnikov Alexei,Vassileva Svetla
Abstract
AbstractIn this paper we prove that the conjugacy problem in the Grigorchuk group Γ has log-space complexity.
Subject
Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Computer Networks and Communications
Reference26 articles.
1. The conjugacy problem in the Grigorchuk group is polynomial time decidable;Groups Geom. Dyn.,2010
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献