On the complexity of computation in finite Abelian, nilpotent and soluble groups

DOI10.1515/dma.1993.3.3.297zbMath0840.20013OpenAlexW2028365496MaRDI QIDQ4303909

Vadim V. Kochergin

Publication date: 7 September 1994

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.1993.3.3.297

zbMATH Keywords

finite soluble groupsschemes of functional elementsword lengthcomputation complexityset of generatorsShannon functionscomputation of finite group elements

Mathematics Subject Classification ID

Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Finite nilpotent groups, (p)-groups (20D15)

Related Items

On some measures of complexity of finite abelian groups