Algorithmic Problems for Solvable Groups

This publication has 19 references indexed in Scilit:

• Some algorithmic problems for solvable groups
  Algebra and Logic, 1974
• Example of a finitely presented group in the variety α5 with the unsolvable word problem
  Algebra and Logic, 1973
• Subgroups of finitely presented metabelian groups
  Journal of the Australian Mathematical Society, 1973
• Algorithmic problems for metabelian groups
  Algebra and Logic, 1973
• A FREEDOM THEOREM FOR GROUPS WITH ONE DEFINING RELATION IN THE VARIETIES OF SOLVABLE AND NILPOTENT GROUPS OF GIVEN LENGTHS
  Mathematics of the USSR-Sbornik, 1972
• Some properties of a magnus embedding
  Algebra and Logic, 1970
• Algorithmic problems forO-power groups-power groups
  Algebra and Logic, 1969
• Conjugacy in polycyclic groups
  Algebra and Logic, 1969
• Conjugacy in nilpotent groups
  Proceedings of the American Mathematical Society, 1965
• Wreath products and finitely presented groups
  Mathematische Zeitschrift, 1961