scientific article; zbMATH DE number 919272

MaRDI QIDQ4888936zbMATH OpenFDO

Authors Vadim V. Kochergin

Publication date 25 August 1996

zbMATH Keywords

finite nilpotent groupsgenerating set

Mathematics Subject Classification ID

Finite nilpotent groups, (p)-groups (20D15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the complexity of computation in finite Abelian, nilpotent and soluble groups
• scientific article; zbMATH DE number 56705
• scientific article; zbMATH DE number 609987
• Parallel complexity for nilpotent groups
• Low-complexity computations for nilpotent subgroup problems
• scientific article; zbMATH DE number 4116805
• On the computational complexity of the theory of Abelian groups
• scientific article; zbMATH DE number 66617
• The complexity of central series in nilpotent computable groups
• scientific article; zbMATH DE number 848088

Cited in

(17)

• On some measures of complexity of finite abelian groups
• The collection formula of a nilpotent group of class 3
• Non-cancellation group computation for some finitely generated nilpotent groups.
• scientific article; zbMATH DE number 4072970 (Why is no real title available?)
• scientific article; zbMATH DE number 1262444 (Why is no real title available?)
• scientific article; zbMATH DE number 609987 (Why is no real title available?)
• On the complexity of computation in finite Abelian, nilpotent and soluble groups
• The computational complexity of torsion-freeness of finitely presented groups
• scientific article; zbMATH DE number 2077108 (Why is no real title available?)
• The Computational Complexity to Evaluate Representations of General Linear Groups
• On complexity of multiplication in finite soluble groups.
• scientific article; zbMATH DE number 4116805 (Why is no real title available?)
• Logspace and compressed-word computations in nilpotent groups
• The complexity of ascendant sequences in locally nilpotent groups
• Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
• Computing representatives of nilpotent orbits of \(\theta\)-groups
• Computational complexity of immanents and representations of the full linear group

This page was built for publication:

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