Computational algorithms for deciding some problems for nilpotent groups

DOI10.4064/FM-59-2-137-152MaRDI QIDQ5518435zbMATH OpenOpenAlexFDO

Authors A. Włodzimierz Mostowski

Publication date 1966

Published in Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/213887

zbMATH Keywords

group theory

Cited in

(5)

• General theory of groups
• Parallel complexity for nilpotent groups
• Logspace and compressed-word computations in nilpotent groups
• \(\mathsf{TC}^0\) circuits for algorithmic problems in nilpotent groups
• Residual finiteness in permutation varieties of semigroups

This page was built for publication: Computational algorithms for deciding some problems for nilpotent groups

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