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
Iliopoulos, C. S. (1983) Worst-case complexity bounds on algorithms for computing the canonical structure of infinite abelian groups and solving systems of linear diophantine equations. Coventry: University of Warwick. Department of Computer Science. (Unpublished)
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
| Item Type: | Report | ||||
|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software | ||||
| Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | ||||
| Publisher: | University of Warwick. Department of Computer Science | ||||
| Place of Publication: | Coventry | ||||
| Official Date: | 1 April 1983 | ||||
| Dates: |
|
||||
| Status: | Not Peer Reviewed | ||||
| Publication Status: | Unpublished | ||||
| Access rights to Published version: | Restricted or Subscription Access | ||||
| Related URLs: |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
