Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6193Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | ONeil, Patrick E. | - |
| dc.date | 2004-10-04T14:45:21Z | - |
| dc.date | 2004-10-04T14:45:21Z | - |
| dc.date | 1971-09-01 | - |
| dc.date.accessioned | 2013-10-09T02:44:02Z | - |
| dc.date.available | 2013-10-09T02:44:02Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-237 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6193 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | 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. | - |
| dc.format | 7489493 bytes | - |
| dc.format | 728875 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-237 | - |
| dc.title | An Inquiry into Algorithmic Complexity | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.