An Inquiry into Algorithmic Complexity
| dc.date.accessioned | 2004-10-04T14:45:21Z | |
| dc.date.accessioned | 2018-11-24T10:12:20Z | |
| dc.date.available | 2004-10-04T14:45:21Z | |
| dc.date.available | 2018-11-24T10:12:20Z | |
| dc.date.issued | 1971-09-01 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/6193 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/6193 | |
| dc.description.abstract | This is the first section in a proposed monograph on algorithmic complexity theory. Future sections shall include: information Theory as a Proof Technique; Algorithms Using Linear Form Inequalities; Some Probabilistic Analyses of Algorithms, etc. Comments, suggestions and corrections are welcomed. Please let me know what you think. This is not a limited distribution document, although I may wish to publish it later. Anyone who develops an idea based on this work to a more advanced state is welcome to publish first. I would be very eager to see any such result as soon as possible. | en_US |
| dc.format.extent | 7489493 bytes | |
| dc.format.extent | 728875 bytes | |
| dc.language.iso | en_US | |
| dc.title | An Inquiry into Algorithmic Complexity | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| AIM-237.pdf | 728.8Kb | application/pdf | View/ |
| AIM-237.ps | 7.489Mb | application/postscript | View/ |