Pages that link to "Item:Q5315431"
From MaRDI portal
The following pages link to Computing the structure of a finite abelian group (Q5315431):
Displaying 12 items.
- Linear and sublinear time algorithms for the basis of abelian groups (Q553345) (← links)
- On isomorphism testing of groups with normal Hall subgroups (Q2637286) (← links)
- A Terr algorithm for computations in the infrastructure of real-quadratic number fields (Q2642773) (← links)
- EFFICIENT ALGORITHMS FOR THE BASIS OF FINITE ABELIAN GROUPS (Q2905283) (← links)
- An Algorithm for Computing a Basis of a Finite Abelian Group (Q3014939) (← links)
- A generic approach to searching for Jacobians (Q3055104) (← links)
- Structure computation and discrete logarithms in finite abelian $p$-groups (Q3081295) (← links)
- Computing Hilbert class polynomials with the Chinese remainder theorem (Q3081296) (← links)
- The infrastructure of a global field of arbitrary unit rank (Q3094298) (← links)
- COMPUTING NORMAL INTEGRAL BASES OF ABELIAN NUMBER FIELDS (Q5229617) (← links)
- Computing the binomial part of a polynomial ideal (Q6192534) (← links)
- Unconditional computation of the class groups of real quadratic fields (Q6494750) (← links)
