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

DOI10.1007/BF00969322MaRDI QIDQ1108264zbMATH OpenFDO

Authors I. V. Latkin

Publication date 1987

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

Full work available at URL https://doi.org/10.1007/BF00969322

zbMATH Keywords

enumerable grouplower central seriesTuring degree

Mathematics Subject Classification ID

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

Review text

See the review in Zbl 0638.03038.

Recommendations

• scientific article; zbMATH DE number 4039876
• Computational complexity of some problems involving congruences on algebras
• Some combinatorial-algebraic problems from complexity theory
• The complexity of the isolators of the lower central series in the computable nilpotent groups
• scientific article; zbMATH DE number 3915503
• scientific article; zbMATH DE number 17839
• Publication:3197949
• scientific article; zbMATH DE number 3936520
• scientific article; zbMATH DE number 3872682
• On the algorithmic complexity of some numeration-related problems

Cited in

(1)

• The complexity of central series in nilpotent computable groups

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108264)