"Worst-Case Complexity Bounds on Algorithms for Computing the Canonical ..."

Costas S. Iliopoulos (1989)

> Home

Details and statistics

DOI: 10.1137/0218046

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/Iliopoulos89a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/Iliopoulos89a
Costas S. Iliopoulos:
Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations. SIAM J. Comput. 18(4): 670-678 (1989)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.