Transactions of the American Mathematical Society · 2022 · 17 citations · 18 references
ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsTheory Of ComputationComputational ComplexityGroup TheoryComputational Group TheoryLogarithmic SpaceMembership ProblemNilpotent GroupsNormal FormsPolynomial Time ComplexityPolynomial-time AlgorithmsPresentation Of Groups
For finitely generated nilpotent groups, we employ Mal’cev coordinates to solve several classical algorithmic problems efficiently. Computation of normal forms, the membership problem, the conjugacy problem, and computation of presentations for subgroups are solved using only logarithmic space and quasilinear time. Logarithmic space presentation-uniform versions of these algorithms are provided. Compressed-word versions of the same problems, in which each input word is provided as a straight-line program, are solved in polynomial time.
18
Word Problems Solvable in Logspace
Richard J. Lipton, Yechezkel Zalcstein · Journal of the ACM · 1977 · 141 citations · Full text
Algorithmics on SLP-compressed strings: A survey
Markus Lohrey · journal of Groups complexity cryptology · 2012 · 140 citations
Conjugate separability in polycyclic groups
Edward Formanek · Journal of Algebra · 1976 · 81 citations
Conjugacy in polycyclic groups
Algebra and Logic · 1969 · 77 citations
Norman Blackburn · Proceedings of the American Mathematical Society · 1965 · 68 citations · Full text