Computational algorithms for deciding some problems for nilpotent groups
From MaRDI portal
Publication:5518435
DOI10.4064/fm-59-2-137-152zbMath0143.03702OpenAlexW1200244928MaRDI QIDQ5518435
Publication date: 1966
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/213887
Related Items (5)
Parallel complexity for nilpotent groups ⋮ Logspace and compressed-word computations in nilpotent groups ⋮ TC^0 circuits for algorithmic problems in nilpotent groups ⋮ General theory of groups ⋮ Residual finiteness in permutation varieties of semigroups
This page was built for publication: Computational algorithms for deciding some problems for nilpotent groups