arXiv (All)
open access
Almost Tight Bounds for Isomorphism Testing and Basis Construction in Finite Abelian Groups
We study isomorphism decision and basis construction for finite Abelian groups of known order $n$. We measure complexity by the number of additions performed in the groups and by the total running time. We give a randomized isomorphism decision algorithm that performs $\tilde O(n^{1/4})$ group addit
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Almost all finite groups are $2$-groups of class two#1248019
- Exploring the unleaved tree of numerical semigroups up to a given genus#1354783
- A Guess and Determine Attack on the Elliptic Curve Discrete Logarithm Problem#363233
- Supersingularity and Superspeciality Verification of Abelian Surfaces#1160921
- Supersingularity and Superspeciality Verification of Abelian Surfaces#1157195
Record · ID 1218015
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive