Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/de-gruyter/log-space-conjugacy-problem-in-the-grigorchuk-group-V02sC1mO53
References (16)
-
Sanjeev Arora, B. Barak (2009)
Computational Complexity: Complexity of counting -
(1998)
The conjugacy problem in an automorphism group of an infinite tree,Mat -
L. Bartholdi (1999)
The growth of Grigorchuk's torsion groupInternational Mathematics Research Notices, 1998
-
H. Vollmer (1999)
Introduction to Circuit Complexity -
Garzon (1991)
The complexity of Grigorchuk groups with application to cryptography TheorComput Sci
-
(2013)
Space and time complexity of algorithmic problems in groups -
I. Lysenok, A. Myasnikov, A. Ushakov (2008)
The Conjugacy Problem in the Grigorchuk Group is polynomial time decidableGroups, Geometry, and Dynamics, 4
-
Diekert (2012)
Logspace computations in Coxeter groups and graph groups Computational and Combinatorial Group Theory and Cryptography Contemp American Mathematical Society ProvidenceMath
-
M. Garzon, Y. Zalcstein (1991)
The Complexity of Grigorchuk Groups with Application to CryptographyTheor. Comput. Sci., 88
-
M. Elder, A. Kalka (2013)
Logspace computations for Garside groups of spindle typeArXiv, abs/1310.0933
-
M. Elder, G. Elston, Gretchen Ostheimer (2012)
On groups that have normal forms computable in logspaceArXiv, abs/1201.4363
-
Yuriy Leonov (1998)
Conjugacy problem in a class of 2-groupsMathematical Notes, 64
-
M. Sipser (1996)
Introduction to the Theory of ComputationSIGACT News, 27
-
R. Lipton, Y. Zalcstein (1977)
Word Problems Solvable in LogspaceJ. ACM, 24
-
Arora (2009)
Computational A Modern Approach Cambridge University Press CambridgeComplexity
-
V. Diekert, Jonathan Kausch, Markus Lohrey (2012)
Logspace Computations in Coxeter Groups and Graph GroupsarXiv: Group Theory
- Publisher
- de Gruyter
- Copyright
- © 2017 by De Gruyter
- ISSN
- 1869-6104
- eISSN
- 1869-6104
- DOI
- 10.1515/gcc-2017-0005
- Publisher site
- See Article on Publisher Site
Abstract
AbstractIn this paper we prove that the conjugacy problem in the Grigorchuk group Γ has log-space complexity.
Journal
Groups Complexity Cryptology – de Gruyter
Published: May 1, 2017