Corpus ID: 721447

Logspace and compressed-word computations in nilpotent groups

@article{MacDonald2015LogspaceAC,
  title={Logspace and compressed-word computations in nilpotent groups},
  author={J. MacDonald and A. Myasnikov and Andrey Nikolaev and S. Vassileva},
  journal={ArXiv},
  year={2015},
  volume={abs/1503.03888}
}
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… Expand
Low-complexity computations for nilpotent subgroup problems
TC0 Circuits for Algorithmic Problems in Nilpotent Groups
Non-commutative lattice problems
Distortion of embeddings of a torsion-free finitely generated nilpotent group into a unitriangular group
Subset sum problem in polycyclic groups
A PTIME solution to the restricted conjugacy problem in generalized Heisenberg groups
Conjugacy of reversible cellular automata
  • V. Salo
  • Mathematics, Computer Science
  • ArXiv
  • 2020
Two general schemes of algebraic cryptography
  • V. Roman'kov
  • Computer Science, Mathematics
  • Groups Complex. Cryptol.
  • 2018
...
1
2
...

References

SHOWING 1-10 OF 42 REFERENCES
Efficient Computation in Groups Via Compression
POLYNOMIAL-TIME WORD PROBLEMS
Compressed Words and Automorphisms in Fully Residually Free Groups
  • J. MacDonald
  • Mathematics, Computer Science
  • Int. J. Algebra Comput.
  • 2010
Matrix representations for torsion-free nilpotent groups by Deep Thought
Solving the Word Problem in Real Time
Word Problems on Compressed Words
  • M. Lohrey
  • Mathematics, Computer Science
  • ICALP
  • 2004
On groups that have normal forms computable in logspace
Compressed Decision Problems for Graph Products and Applications to (outer) Automorphism Groups
Algorithmics on SLP-compressed strings: A survey
  • M. Lohrey
  • Computer Science
  • Groups Complex. Cryptol.
  • 2012
Full residual finiteness growths of nilpotent groups
...
1
2
3
4
5
...