Linear and sublinear time algorithms for the basis of abelian groups
From MaRDI portal
Publication:553345
DOI10.1016/j.tcs.2010.06.011zbMath1217.68244OpenAlexW2016871353MaRDI QIDQ553345
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
Related Items
Space efficient representations of finite groups, Compact data structures for Dedekind groups and finite rings, An Algorithm for Computing a Basis of a Finite Abelian Group, Nearly linear time isomorphism algorithms for some nonabelian group classes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Group-theoretic algorithms and graph isomorphism
- 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
- A Deterministic Algorithm for Solving n = fu 2 + gυ 2 in Coprime Integers u and υ
- A space efficient algorithm for group structure computation
- On some computational problems in finite abelian groups
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Computing the structure of a finite abelian group