Linear time algorithms for Abelian group isomorphism and related problems
From MaRDI portal
Publication:2643019
DOI10.1016/j.jcss.2007.03.013zbMath1165.68036MaRDI QIDQ2643019
Publication date: 23 August 2007
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2007.03.013
68Q25: Analysis of algorithms and problem complexity
20K01: Finite abelian groups
20-04: Software, source code, etc. for problems pertaining to group theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Fast Monte Carlo algorithms for permutation groups
- Sublinear algorithms for testing monotone and unimodal distributions
- Some new upper bounds on the generation of prime numbers
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- On the nlog n isomorphism technique (A Preliminary Report)
- On the complexity of some problems on groups input as multiplication tables