Linear and sublinear time algorithms for the basis of abelian groups
type: Item
instance of: scholarly article
title: Linear and sublinear time algorithms for the basis of abelian groups
zbMATH Open document ID: 1217.68244
author: Li Chen
author: Bin Fu
published in: Theoretical Computer Science
publication date: 2011-07-27T00:00:00Z
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 20K01
zbMATH DE Number: 5932527
zbMATH Keywords: abelian group
zbMATH Keywords: randomization
zbMATH Keywords: decomposition
zbMATH Keywords: basis of abelian group
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.06.011
OpenAlex ID: W2016871353
cites work: Q4335288
cites work: On some computational problems in finite abelian groups
cites work: Computing the structure of a finite abelian group
cites work: Introduction to algorithms
cites work: On isomorphism testing of a class of 2-nilpotent groups
cites work: A Deterministic Algorithm for Solving n = fu 2 + gυ 2 in Coprime Integers u and υ
cites work: Group-theoretic algorithms and graph isomorphism
cites work: Q4044675
cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
cites work: Linear time algorithms for Abelian group isomorphism and related problems
cites work: Q4273947
cites work: Graph isomorphism, general remarks
cites work: Q4745878
cites work: Q5628224
cites work: Q4285784
cites work: A space efficient algorithm for group structure computation
cites work: An \(O(n)\) algorithm for Abelian \(p\)-group isomorphism and an \(O(n \log n)\) algorithm for Abelian group isomorphism
DOI: 10.1016/J.TCS.2010.06.011
description: scientific article; zbMATH DE number 5932527