Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6193| Title: | An Inquiry into Algorithmic Complexity |
| Issue Date: | 9-Oct-2013 |
| 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. |
| URI: | http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
| Other Identifiers: | AIM-237 http://hdl.handle.net/1721.1/6193 |
| 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.