The Library
WORST CASE COMPLEXITY-BOUNDS ON ALGORITHMS FOR COMPUTING THE CANONICAL STRUCTURE OF FINITE ABELIAN-GROUPS AND THE HERMITE AND SMITH NORMAL FORMS OF AN INTEGER MATRIX
Tools
Tools
Tools
UNSPECIFIED (1989) WORST CASE COMPLEXITY-BOUNDS ON ALGORITHMS FOR COMPUTING THE CANONICAL STRUCTURE OF FINITE ABELIAN-GROUPS AND THE HERMITE AND SMITH NORMAL FORMS OF AN INTEGER MATRIX. SIAM JOURNAL ON COMPUTING, 18 (4). pp. 658-669. ISSN 0097-5397.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
| Item Type: | Journal Article | ||||
|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software Q Science > QA Mathematics |
||||
| Journal or Publication Title: | SIAM JOURNAL ON COMPUTING | ||||
| Publisher: | SIAM PUBLICATIONS | ||||
| ISSN: | 0097-5397 | ||||
| Official Date: | August 1989 | ||||
| Dates: |
|
||||
| Volume: | 18 | ||||
| Number: | 4 | ||||
| Number of Pages: | 12 | ||||
| Page Range: | pp. 658-669 | ||||
| Publication Status: | Published |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
