Provable conditions in computational complexity theory
| dc.contributor.author | Sachse-Akerlind, Daryel | |
| dc.date.accessioned | 2017-12-21T04:18:10Z | |
| dc.date.available | 2017-12-21T04:18:10Z | |
| dc.date.copyright | 1983 | |
| dc.date.issued | 1983 | |
| dc.date.updated | 2017-11-23T00:18:43Z | |
| dc.format.extent | 83 leaves | |
| dc.identifier.other | b1242058 | |
| dc.identifier.uri | http://hdl.handle.net/1885/138945 | |
| dc.subject.lcsh | Algorithms | |
| dc.subject.lcsh | Computational complexity | |
| dc.title | Provable conditions in computational complexity theory | |
| dc.type | Thesis (PhD) | |
| dcterms.license | This thesis has been made available through exception 200AB to the Copyright Act. | |
| local.description.notes | Thesis (Ph.D.)--Australian National University, 1983 | |
| local.identifier.doi | 10.25911/5d6cfb30aa36d | |
| local.identifier.proquest | Yes | |
| local.mintdoi | mint |
Downloads
Original bundle
1 - 1 of 1
Loading...
- Name:
- b1242058x_Sachse-Akerlind, Daryel.pdf
- Size:
- 190.63 MB
- Format:
- Adobe Portable Document Format