Computing in general Abelian groups is hard (Q1070820)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing in general Abelian groups is hard |
scientific article; zbMATH DE number 3938568
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing in general Abelian groups is hard |
scientific article; zbMATH DE number 3938568 |
Statements
Computing in general Abelian groups is hard (English)
0 references
1985
0 references
group-theoretic complexity
0 references
cyclicity
0 references
relative complexity
0 references
generators
0 references
set of defining relations
0 references
order of an element
0 references
membership testing
0 references
canonical structure
0 references
Polynomial time reductions
0 references
prime factorization
0 references
primality testing
0 references
