Pages that link to "Item:Q4210962"
From MaRDI portal
The following pages link to A space efficient algorithm for group structure computation (Q4210962):
Displaying 16 items.
- An efficient collision detection method for computing discrete logarithms with Pollard's rho (Q411043) (← links)
- Linear and sublinear time algorithms for the basis of abelian groups (Q553345) (← links)
- A low-memory algorithm for finding short product representations in finite groups. (Q664395) (← links)
- The distributions of individual bits in the output of multiplicative operations (Q892279) (← links)
- The Pohlig-Hellman method generalized for group structure computation (Q1300626) (← links)
- Solving discrete logarithm problems faster with the aid of pre-computation (Q2322875) (← links)
- On random walks for Pollard's rho method (Q2701566) (← 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)
- Determining the small solutions to 𝑆-unit equations (Q4257699) (← links)
- COMPUTING NORMAL INTEGRAL BASES OF ABELIAN NUMBER FIELDS (Q5229617) (← links)
- Solving 𝑆-unit, Mordell, Thue, Thue–Mahler and Generalized Ramanujan–Nagell Equations via the Shimura–Taniyama Conjecture (Q6101092) (← links)
- Computing the binomial part of a polynomial ideal (Q6192534) (← links)
