On the complexity of computation in finite Abelian, nilpotent and soluble groups (Q4303909): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1675531 |
Changed an Item |
||
| Property / author | |||
| Property / author: Vadim V. Kochergin / rank | |||
Normal rank | |||
Revision as of 03:53, 29 February 2024
scientific article; zbMATH DE number 634054
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of computation in finite Abelian, nilpotent and soluble groups |
scientific article; zbMATH DE number 634054 |
Statements
On the complexity of computation in finite Abelian, nilpotent and soluble groups (English)
0 references
7 September 1994
0 references
word length
0 references
schemes of functional elements
0 references
computation of finite group elements
0 references
set of generators
0 references
computation complexity
0 references
finite soluble groups
0 references
Shannon functions
0 references
