Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations

DOI10.1137/0218046zbMath0689.68060OpenAlexW1976899945MaRDI QIDQ3031928

Costas S. Iliopoulos

Publication date: 1989

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0218046

zbMATH Keywords

Abelian groupdiophantine equations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Finite abelian groups (20K01) Canonical forms, reductions, classification (15A21) Abelian groups (20K99)

Related Items (2)

Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients ⋮ Recognizing badly presented \(Z\)-modules

This page was built for publication: Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations