Computing a basis for a finite Abelian p-group
From MaRDI portal
Publication:1074705
Recommendations
Cites work
- scientific article; zbMATH DE number 4172389 (Why is no real title available?)
- scientific article; zbMATH DE number 3443813 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- scientific article; zbMATH DE number 3353398 (Why is no real title available?)
- Analysis of algorithms on problems in general abelian groups
- Computing in general Abelian groups is hard
- Fast computation of continued fraction expansions.
Cited in
(6)- An Algorithm for Computing a Basis of a Finite Abelian Group
- Analysis of algorithms on problems in general abelian groups
- Monte Carlo circuits for the abelian permutation group intersection problem
- Decomposability of finitely generated torsion-free nilpotent groups
- Efficient algorithms for the basis of finite abelian groups
- scientific article; zbMATH DE number 3979371 (Why is no real title available?)
This page was built for publication: Computing a basis for a finite Abelian p-group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1074705)