scientific article; zbMATH DE number 1257081

MaRDI QIDQ4228737zbMATH OpenFDO

Authors S. M. Paulus, Johannes Buchmann

Publication date 7 July 1999

zbMATH Keywords

complexitycomputational problemsfinite Abelian groups

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Software, source code, etc. for problems pertaining to group theory (20-04) Finite abelian groups (20K01) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Efficient algorithms for the basis of finite abelian groups
• On some computational problems in finite abelian groups
• Algorithms for polycyclic-by-finite groups
• scientific article; zbMATH DE number 1419254
• Algorithms for finite soluble groups and applications
• Analysis of algorithms on problems in general abelian groups
• GAP algorithms for finite Abelian groups and applications.
• Algorithms in linear algebraic groups
• scientific article; zbMATH DE number 609987

Cited in

(14)

• Analysis of algorithms on problems in general abelian groups
• Computing in general Abelian groups is hard
• The Pohlig-Hellman method generalized for group structure computation
• Efficient algorithms for the basis of finite abelian groups
• Succinct representation of finite abelian groups
• An Algorithm for Computing a Basis of a Finite Abelian Group
• Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations
• Structure computation and discrete logarithms in finite abelian \(p\)-groups
• scientific article; zbMATH DE number 3871319 (Why is no real title available?)
• On some computational problems in finite abelian groups
• Algorithms for polycyclic-by-finite groups
• Computing the structure of a finite abelian group
• Algorithmically finite groups.
• Root extraction in finite abelian groups

This page was built for publication:

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