33 citations · 63 across the 8 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.GR2015
Non-commutative lattice problems
Alexei Myasnikov, Andrey Nikolaev, Alexander Ushakov
We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find po…
math.GR2015★ 2 cited
Logspace and compressed-word computations in nilpotent groups
Jeremy Macdonald, Alexei Myasnikov, Andrey Nikolaev +1
For finitely generated nilpotent groups, we employ Mal'cev coordinates to solve several classical algorithmic problems efficiently. Computation of normal forms, the membership prob…