Linear and sublinear time algorithms for the basis of abelian groups

DOI10.1016/J.TCS.2010.06.011zbMATH Open1217.68244OpenAlexW2016871353MaRDI QIDQ553345FDOQ553345

Authors: Li Chen, Bin Fu 

Publication date: 27 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.06.011

Recommendations

• Linear and sublinear time algorithms for basis of abelian groups
• Linear time algorithms for the basis of Abelian groups.
• Efficient algorithms for the basis of finite abelian groups
• An Algorithm for Computing a Basis of a Finite Abelian Group
• Analysis of algorithms on problems in general abelian groups

zbMATH Keywords

randomizationdecompositionabelian groupbasis of abelian group

Mathematics Subject Classification ID

Randomized algorithms (68W20) Finite abelian groups (20K01)

Cites Work

• Introduction to algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Group-theoretic algorithms and graph isomorphism
• Title not available (Why is that?)
• Title not available (Why is that?)
• A space efficient algorithm for group structure computation
• On isomorphism testing of a class of 2-nilpotent groups
• Graph isomorphism, general remarks
• An \(O(n)\) algorithm for Abelian \(p\)-group isomorphism and an \(O(n \log n)\) algorithm for Abelian group isomorphism
• Linear time algorithms for Abelian group isomorphism and related problems
• On some computational problems in finite abelian groups
• A Deterministic Algorithm for Solving n = fu 2 + gυ 2 in Coprime Integers u and υ
• Title not available (Why is that?)
• Title not available (Why is that?)
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Computing the structure of a finite abelian group

Cited In (10)

• Compact data structures for Dedekind groups and finite rings
• Efficient algorithms for the basis of finite abelian groups
• An Algorithm for Computing a Basis of a Finite Abelian Group
• Analysis of algorithms on problems in general abelian groups
• Nearly linear time isomorphism algorithms for some nonabelian group classes
• Space efficient representations of finite groups
• Linear and sublinear time algorithms for basis of abelian groups
• Linear time algorithms for the basis of Abelian groups.
• Title not available (Why is that?)
• Polynomial-time algorithms for finding elements of prime order and sylow subgroups

This page was built for publication: Linear and sublinear time algorithms for the basis of abelian groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q553345)