A space efficient algorithm for group structure computation

DOI10.1090/S0025-5718-98-00968-5MaRDI QIDQ4210962zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Edlyn Teske

Publication date 10 September 1998

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/s0025-5718-98-00968-5

zbMATH Keywords

computational complexityfinite abelian groupgeneric algorithmsgroup structureideal class groupsimaginary quadratic ordersPollard's \(\rho\)-method

Mathematics Subject Classification ID

Class numbers, class groups, discriminants (11R29) Class groups and Picard groups of orders (11R65) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Software, source code, etc. for problems pertaining to group theory (20-04) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• Space efficient representations of finite groups
• A data structure for a uniform approach to computations with finite groups
• Embeddings into efficient groups
• Space complexity and word problems of groups
• Towards effective algorithms for linear groups.
• Space-conserving agglomerative algorithms

Cites work

• A Monte Carlo Factoring Algorithm With Linear Storage
• An improved Monte Carlo factorization algorithm
• scientific article; zbMATH DE number 3836162 (Why is no real title available?)
• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 4069911 (Why is no real title available?)
• scientific article; zbMATH DE number 3782908 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• On some computational problems in finite abelian groups

Cited in

(20)

• The Pohlig-Hellman method generalized for group structure computation
• Space efficient representations of finite groups
• Solving discrete logarithm problems faster with the aid of pre-computation
• On random walks for Pollard's rho method
• Efficient algorithms for the basis of finite abelian groups
• An Algorithm for Computing a Basis of a Finite Abelian Group
• A generic approach to searching for Jacobians
• Structure computation and discrete logarithms in finite abelian \(p\)-groups
• Computing Hilbert class polynomials with the Chinese remainder theorem
• scientific article; zbMATH DE number 4069911 (Why is no real title available?)
• An efficient collision detection method for computing discrete logarithms with Pollard's rho
• Determining the small solutions to 𝑆-unit equations
• On some computational problems in finite abelian groups
• Computing normal integral bases of abelian number fields
• Computing the structure of a finite abelian group
• Linear and sublinear time algorithms for the basis of abelian groups
• Solving 𝑆-unit, Mordell, Thue, Thue–Mahler and Generalized Ramanujan–Nagell Equations via the Shimura–Taniyama Conjecture
• Computing the binomial part of a polynomial ideal
• A low-memory algorithm for finding short product representations in finite groups.
• The distributions of individual bits in the output of multiplicative operations

Describes a project that uses

Uses Software

• LiDIA

This page was built for publication: A space efficient algorithm for group structure computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210962)