Algorithmic complexity of the problem of occurrence in commutants and members of the lower central series

DOI10.1007/BF00969322zbMath0654.03027MaRDI QIDQ1108264

I. V. Latkin

Publication date: 1987

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

lower central seriesTuring degreeenumerable group

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Nilpotent groups (20F18) Complexity of computation (including implicit computational complexity) (03D15) Derived series, central series, and generalizations for groups (20F14) Theory of numerations, effectively presented structures (03D45)

Related Items (1)

The complexity of central series in nilpotent computable groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithmic complexity of the problem of occurrence in commutants and members of the lower central series