Computing in general Abelian groups is hard
type: Item
instance of: scholarly article
title: Computing in general Abelian groups is hard
zbMATH Open document ID: 0585.68053
DOI: 10.1016/0304-3975(85)90061-1
author: Costas S. Iliopoulos
published in: Theoretical Computer Science
publication date: 1985-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 20F05
Mathematics Subject Classification ID: 20K01
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 11A41
Mathematics Subject Classification ID: 11-04
zbMATH DE Number: 3938568
zbMATH Keywords: group-theoretic complexity
zbMATH Keywords: cyclicity
zbMATH Keywords: relative complexity
zbMATH Keywords: generators
zbMATH Keywords: set of defining relations
zbMATH Keywords: order of an element
zbMATH Keywords: membership testing
zbMATH Keywords: canonical structure
zbMATH Keywords: Polynomial time reductions
zbMATH Keywords: prime factorization
zbMATH Keywords: primality testing
MaRDI profile type: Publication
full work available at URL: 0304-3975(85)90061-1
OpenAlex ID: W2015970419
cites work: On distinguishing prime numbers from composite numbers
cites work: On the computational power of pushdown automata
cites work: The distribution of quadratic residues and non‐residues
cites work: Factorization and Primality Tests
cites work: Q4198056
cites work: Group-theoretic algorithms and graph isomorphism
cites work: Analysis of algorithms on problems in general abelian groups
cites work: Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix
cites work: Q3935355
cites work: Q4135671
cites work: Riemann's hypothesis and tests for primality
cites work: Fast multiplication of large numbers
cites work: Q5628224
cites work: Q4769161
description: scientific article; zbMATH DE number 3938568