The Library
WORST CASE COMPLEXITY-BOUNDS ON ALGORITHMS FOR COMPUTING THE CANONICAL STRUCTURE OF INFINITE ABELIAN-GROUPS AND SOLVING SYSTEMS OF LINEAR DIOPHANTINE EQUATIONS
Tools
Tools
Tools
UNSPECIFIED (1989) WORST CASE COMPLEXITY-BOUNDS ON ALGORITHMS FOR COMPUTING THE CANONICAL STRUCTURE OF INFINITE ABELIAN-GROUPS AND SOLVING SYSTEMS OF LINEAR DIOPHANTINE EQUATIONS. SIAM JOURNAL ON COMPUTING, 18 (4). pp. 670-678. ISSN 0097-5397
Full text not available from this repository.| 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 |
| Date: | August 1989 |
| Volume: | 18 |
| Number: | 4 |
| Number of Pages: | 9 |
| Page Range: | pp. 670-678 |
| Publication Status: | Published |
| URI: | http://wrap.warwick.ac.uk/id/eprint/23748 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
